- author = "Omer A. Chaudhri and Jason M. Daida and Jonathan C. Khoo and Wendell S. Richardson and Rachel B. Harrison and William J. Sloat",
- title = "Characterizing a Tunably Difficult Problem in Genetic Programming",
- pages = "395--402",
- year = "2000",
- publisher = "Morgan Kaufmann",
- booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000)",
- editor = "Darrell Whitley and David Goldberg and Erick Cantu-Paz and Lee Spector and Ian Parmee and Hans-Georg Beyer",
- address = "Las Vegas, Nevada, USA",
- publisher_address = "San Francisco, CA 94104, USA",
- month = "10-12 " # jul,
- keywords = "genetic algorithms, genetic programming, binomial-3 problem, ephemeral random constant, ERC",
- ISBN = "1-55860-708-0",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2000/GP206.pdf",
-
URL = "
https://hdl.handle.net/2027.42/45613",
- size = "8 pages",
- abstract = "We examine the behavioral phenomena that occur with the tuning of the binomial-3 problem. Our analysis identifies a distinct set of phenomena that may be generalisable to other problems. These phenomena also bring into question whether GA theory has any bearing on GP theory",
-
notes = "p402 'it pays to optimize for the terminal (and
function) set.'
A joint meeting of the ninth International Conference on Genetic Algorithms (ICGA-2000) and the fifth Annual Genetic Programming Conference (GP-2000) Part of \cite{whitley:2000:GECCO}
The University of Michigan, Artificial Intelligence Laboratory and Space Physics Research Laboratory 2455 Hayward Avenue, Ann Arbor, Michigan 48109-2143",
