-
41
-
42
An evolutionary approach to load balancing parallel computations
Published 1991“…It is based on a genetic algorithm that combines a number of design choices in order to ameliorate the problem of premature convergence. …”
Get full text
Get full text
Get full text
conferenceObject -
43
Robust Kalman filter and smoother for errors-in-variables model with observation outliers based on Least-Trimmed-Squares
Published 2020“…Since the LTS is combinatorial optimization problem the randomized algorithm has been proposed in order to achieve the optimal estimate. …”
Get full text
article -
44
Information warfare recovery-fighting back through the matrix. (c2012)
Published 2012Get full text
Get full text
masterThesis -
45
Deep Reinforcement Learning for Resource Constrained HLS Scheduling
Published 2022“…The two main steps in HLS are: operations scheduling and data-path allocation. In this work, we present a resource constrained scheduling approach that minimizes latency and subject to resource constraints using a deep Q learning algorithm. …”
Get full text
Get full text
Get full text
masterThesis -
46
A Blockchain Model for Secure Communications in Internet of Vehicles
Published 2021“…Secure data communication is vital to the success and stability of the IoV and should be integrated into its various operations and aspects. In this paper, we present a framework for secure IoV communications by utilizing the High Performance Blockchain Consensus (HPBC) algorithm. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
47
Efficient Test Compaction for Combinational Circuits Based on Fault Detection Count-Directed Clustering
Published 2006“…Test compaction is an effective technique for reducing test data volume and test application time. In this paper, we present a new static test compaction algorithm based on test vector decomposition and clustering. …”
Get full text
article -
48
-
49
Efficient unified Montgomery inversion with multi-bit shifting
Published 2005“…They present two inversion algorithms for binary extension and prime fields, which are slightly modified versions of the Montgomery inversion algorithm. …”
Get full text
Get full text
article -
50
Failure recovery in wireless content distribution networks with device-to-device cooperation
Published 2017“…In this work, we focus on failure recovery and scalability in wireless content distribution networks with device-to-device cooperation, where a number of mobile devices in a given geographical area are interested in downloading a common content from an application service provider. We present low complexity effective algorithms based on clustering and tree construction methods in order to address three different types of dynamic node behavior, namely new devices joining the network, existing devices leaving the network, and existing devices moving locally within the network. …”
Get full text
Get full text
Get full text
Get full text
article -
51
-
52
A new approach and faster exact methods for the maximum common subgraph problem
Published 2017“…This structure contains a large number of naturally-ordered cliques that are present in the association graph’s complement. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
53
Modeling and Control of Nonlinear Systems Using Wavelet Networks
Published 2006Get full text
doctoralThesis -
54
-
55
Modelling surface currents in the Eastern Levantine Mediterranean using surface drifters and satellite altimetry
Published 2016“…We present a new and fast method that blends altimetric and drifter positions data in order to predict the surface velocity in the Eastern Levantine Mediterranean. …”
Get full text
Get full text
Get full text
Get full text
article -
56
Robustness evaluation of real-Time Protocols
Published 2006“…We extract test sequences from the nominal specification and we inject automatically faults in order to model hostile environments. A quantitative system is presented. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
57
The maximum common subgraph problem
Published 2017“…This is made possible by exploiting an efficient decomposition of a graph into a minimum vertex cover and the maximum independent set in its complement. The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
58
Robustness testing of composed real-time systems
Published 2010“…Each tester is dedicated to test a single SUT component. A test execution algorithm is presented. Testing the SUT is divided into two phases. …”
Get full text
Get full text
Get full text
Get full text
article -
59
-
60
On the Generation of Quantified Lemmas
Published 2018“…<p dir="ltr">In this paper we present an algorithmic method of lemma introduction. …”
