Sciweavers

1099 search results - page 162 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
GECCO
2004
Springer
138views Optimization» more  GECCO 2004»
15 years 9 months ago
Exploratory Data Analysis with Interactive Evolution
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
Sergey Malinchik, Eric Bonabeau
ICES
2003
Springer
111views Hardware» more  ICES 2003»
15 years 9 months ago
Spiking Neural Networks for Reconfigurable POEtic Tissue
Abstract. Vertebrate and most invertebrate organisms interact with their environment through processes of adaptation and learning. Such processes are generally controlled by comple...
Jan Eriksson, Oriol Torres, Andrew Mitchell, Gayle...
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
15 years 8 months ago
Improved step size adaptation for the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is an evolutionary algorithm for continuous vector-valued optimization. It combines indicator-based...
Thomas Voß, Nikolaus Hansen, Christian Igel
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 8 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 8 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