193 search results - page 4 / 39 » Chromosome Reuse in Genetic Algorithms |
158
click to vote
GECCO
2005
Springer
16 years 29 days ago
2005
Springer
This paper introduces an evolutionary algorithm which uses multiple chromosomes to evolve solutions to a symbolic regression problem. Inspiration for this algorithm is provided by...
147
click to vote
GECCO
2004
Springer
16 years 24 days ago
2004
Springer
In this work, we investigate the ability of a Chunking GA (ChGA) to reduce the size of variable length chromosomes and control bloat. The ChGA consists of a standard genetic algori...
192
Voted
GECCO
2005
Springer
16 years 29 days ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
202
Voted
EVOW
2003
Springer
16 years 19 days ago
2003
Springer
Chromosomal aberrations are differences in DNA sequence copy number of chromosome regions 3 . These differences may be crucial genetic events in the development and progression o...
226
Voted
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...