EC
1998
13 years 4 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...
FOGA
1994
13 years 5 months ago
1994
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the differential of th...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
The organizational algorithm is examined as a computational approach to representing interpersonal learning. The structure of the algorithm is introduced and described in context ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
We present a covariant form for genetic dynamics and show how different formulations are simply related by linear coordinate transformations. In particular, in the context of the ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
SGAI
2007
Springer
13 years 10 months ago
2007
Springer
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...