416 search results - page 56 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Coevolution has often been based on averaged outcomes, resulting in unstable evaluation. Several theoretical approaches have used archives to provide stable evaluation. However, t...
COR
2008
13 years 7 months ago
2008
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
EGC
2005
Springer
14 years 1 months ago
2005
Springer
Genetic algorithms (GAs) are stochastic search methods that have been successfully applied in many search, optimization, and machine learning problems. Their parallel counterpart (...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...