Sciweavers

265 search results - page 19 / 53
» Neighborhood Composition: A Parallelization of Local Search ...
Sort
View
CONCUR
2009
Springer
14 years 3 months ago
Compositional Control Synthesis for Partially Observable Systems
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
Wouter Kuijper, Jaco van de Pol
CF
2007
ACM
14 years 13 days ago
Parallel genomic sequence-search on a massively parallel system
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...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
PPSN
2010
Springer
13 years 6 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
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...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
ICASSP
2011
IEEE
13 years 5 days ago
Consensus-based distributed particle filtering algorithms for cooperative blind equalization in receiver networks
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...
Claudio J. Bordin, Marcelo G. S. Bruno
JCO
2007
130views more  JCO 2007»
13 years 8 months ago
On edge orienting methods for graph coloring
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 ...
Bernard Gendron, Alain Hertz, Patrick St-Louis