Sciweavers

203 search results - page 5 / 41
» Fitness landscapes and problem hardness in evolutionary comp...
Sort
View
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
13 years 9 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
13 years 11 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
13 years 10 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
EUROGP
2001
Springer
13 years 10 months ago
Neutrality and the Evolvability of Boolean Function Landscape
This work is a study of neutrality in the context of Evolutionary Computation systems. In particular, we introduce the use of explicit neutrality with an integer string coding sche...
Tina Yu, Julian F. Miller
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
13 years 9 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba