GECCO
2005
Springer
2005
Springer
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
13 years 11 months ago
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...