Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InProceedings{daida:1999:MSWMPGATDPGP,
author = "Jason M. Daida and John A. Polito and
Steven A. Stanhope and Robert R. Bertram and Jonathan C. Khoo and
Shahbaz A. Chaudhary",
title = "What Makes a Problem {GP}-Hard? Analysis of a Tunably
Difficult Problem in Genetic Programming",
booktitle = "Proceedings of the Genetic and Evolutionary
Computation Conference",
year = "1999",
editor = "Wolfgang Banzhaf and Jason Daida and
Agoston E. Eiben and Max H. Garzon and Vasant Honavar and
Mark Jakiela and Robert E. Smith",
volume = "2",
pages = "982--989",
address = "Orlando, Florida, USA",
publisher_address = "San Francisco, CA 94104, USA",
month = "13-17 " # jul,
publisher = "Morgan Kaufmann",
keywords = "genetic algorithms, genetic programming",
ISBN = "1-55860-611-4",
URL = "
ftp://ftp.eecs.umich.edu/people/daida/papers/GECCO99landscape.pdf",
URL = "
http://citeseer.ist.psu.edu/240700.html",
URL = "
http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-444.pdf",
URL = "
http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-444.ps",
abstract = "This paper addresses the issue of what makes a problem
GP-hard by considering the binomial-3 problem. In the
process, we discuss the efficacy of the metaphor of an
adaptive fitness landscape to explain what is GP-hard.
We show that for at least this problem, the metaphor is
misleading.",
notes = "GECCO-99 A joint meeting of the eighth international
conference on genetic algorithms (ICGA-99) and the
fourth annual genetic programming conference (GP-99)",
}
Genetic Programming entries for Jason M Daida John A Polito 2 Stephen A Stanhope Robert R Bertram Jonathan C Khoo Shahbaz A Chaudhary