GECCO
2006
Springer
13 years 8 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...