835 search results - page 20 / 167 » Dynamic populations in genetic algorithms |
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
In an evolutionary algorithm, the population has a very important role as its size has direct implications regarding solution quality, speed, and reliability. Theoretical studies ...
100
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
96
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
FOGA
1994
15 years 1 months ago
1994
An important goal of the theory of genetic algorithms is to build predictive models of how well genetic algorithms are expected to perform, given a representation, a fitness lands...