Sciweavers

4229 search results - page 308 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2009
Springer
170views Optimization» more  GECCO 2009»
15 years 6 months ago
Benchmarking a BI-population CMA-ES on the BBOB-2009 noisy testbed
We benchmark the BI-population CMA-ES on the BBOB2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategi...
Nikolaus Hansen
121
Voted
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 6 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
GECCO
2006
Springer
129views Optimization» more  GECCO 2006»
15 years 5 months ago
Use of statistical outlier detection method in adaptive evolutionary algorithms
In this paper, the issue of adapting probabilities for Evolutionary Algorithm (EA) search operators is revisited. A framework is devised for distinguishing between measurements of...
James M. Whitacre, Q. Tuan Pham, Ruhul A. Sarker
105
Voted
ATAL
2008
Springer
15 years 3 months ago
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Distributed constraint optimization problems (DCOPs) are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOPs optimally with m...
William Yeoh, Ariel Felner, Sven Koenig
120
Voted
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 2 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe