1093 search results - page 11 / 219 » Crossover in Probability Spaces |
CEC
2005
IEEE
13 years 12 months ago
2005
IEEE
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we examine the effects of single node mutations on trees evolved via genetic programming. The results show that neutral mutations are less likely for nodes nearer th...
PPSN
1998
Springer
14 years 2 months ago
1998
Springer
In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination w...
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
Bloat is a common problem with Evolutionary Algorithms (EAs) that use variable length representation. By creating unnecessarily large individuals it results in longer EA runtimes ...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...