5595 search results - page 21 / 1119 » Comparing Subsumption Optimizations |
GECCO
2010
Springer
14 years 5 days ago
2010
Springer
In this paper, we compare the (1+1)-CMA-ES to the (1+2s m)CMA-ES, a recently introduced quasi-random (1+2)-CMAES that uses mirroring as derandomization technique as well as a sequ...
GECCO
2010
Springer
14 years 5 days ago
2010
Springer
The increase in the complexity of modern software has led to the commensurate growth in the size and execution time of the test suites for these programs. In order to address this...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...