Sciweavers

424 search results - page 67 / 85
» Improving Evolutionary Algorithms with Scouting
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
13 years 11 months ago
Particle swarm with speciation and adaptation in a dynamic environment
This paper describes an extension to a speciation-based particle swarm optimizer (SPSO) to improve performance in dynamic environments. The improved SPSO has adopted several prove...
Xiaodong Li, Jürgen Branke, Tim Blackwell
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 9 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
14 years 2 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
CORR
2011
Springer
235views Education» more  CORR 2011»
13 years 2 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
GECCO
2003
Springer
112views Optimization» more  GECCO 2003»
14 years 1 months ago
Dispersion-Based Population Initialization
Reliable execution and analysis of an evolutionary algorithm (EA) normally requires many runs to provide reasonable assurance that stochastic effects have been properly considered...
Ronald W. Morrison