Sciweavers

GECCO
2000
Springer

Characterizing a Tunably Difficult Problem in Genetic Programming

13 years 8 months ago
Characterizing a Tunably Difficult Problem in Genetic Programming
This paper examines the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalizable to other problems. These phenomena also bring into question whether GA theory has any bearing on GP theory.
Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where GECCO
Authors Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat
Comments (0)