59 search results - page 1 / 12 » An Analysis of Punctuated Equilibria in Simple Genetic Algor... |
AE
1997
Springer
13 years 9 months ago
1997
Springer
In the running of a genetic algorithm, the population is liable to be con ned in the local optimum, that is the metastable state, making an equilibrium. It is known that, after a l...
FOGA
2011
12 years 9 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
CIMCA
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper presents the comparison of performance on a simple genetic algorithm (SGA) using roulette wheel selection and tournament selection. A SGA is mainly composed of three ge...
EC
1998
13 years 5 months ago
1998
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...