265 search results - page 19 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
98
Voted
CONCUR
2009
Springer
15 years 9 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
153
click to vote
CF
2007
ACM
15 years 7 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
131
click to vote
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
116
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We describe in this paper novel consensus-based distributed particle filtering algorithms which are applied to cooperative blind equalization of frequency-selective channels in a...
127
click to vote
JCO
2007
15 years 3 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...