Sciweavers

416 search results - page 26 / 84
» Approximation Algorithms for Reliable Stochastic Combinatori...
Sort
View
APIN
1999
114views more  APIN 1999»
13 years 8 months ago
Evolutionary Approaches to Figure-Ground Separation
The problem of figure-ground separation is tackled from the perspective of combinatorial optimization. Previous attempts have used deterministic optimization techniques based on re...
Suchendra M. Bhandarkar, Xia Zeng
TCBB
2008
126views more  TCBB 2008»
13 years 8 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen
ATAL
2007
Springer
14 years 2 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
13 years 3 months ago
Sensor-based robot deployment algorithms
Abstract-- In robot deployment problems, the fundamental issue is to optimize a steady state performance measure that depends on the spatial configuration of a group of robots. For...
Jerome Le Ny, George J. Pappas
COR
2006
122views more  COR 2006»
13 years 8 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...