%0 Conference Paper %1 daida:1999:MSWMPGATDPGP %A Daida, Jason M. %A Polito, John A. %A Stanhope, Steven A. %A Bertram, Robert R. %A Khoo, Jonathan C. %A Chaudhary, Shahbaz A. %B Proceedings of the Genetic and Evolutionary Computation Conference %C Orlando, Florida, USA %D 1999 %E Banzhaf, Wolfgang %E Daida, Jason %E Eiben, Agoston E. %E Garzon, Max H. %E Honavar, Vasant %E Jakiela, Mark %E Smith, Robert E. %I Morgan Kaufmann %K algorithms, and evolvable genetic hardware programming %P 982--989 %T What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming %U http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-444.ps %V 2 %X 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. %@ 1-55860-611-4

@inproceedings{daida:1999:MSWMPGATDPGP, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Orlando, Florida, USA}, author = {Daida, Jason M. and Polito, John A. and Stanhope, Steven A. and Bertram, Robert R. and Khoo, Jonathan C. and Chaudhary, Shahbaz A.}, biburl = {https://www.bibsonomy.org/bibtex/2c3c959a9adc34eeae8fcf178e23d441b/brazovayeye}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}, editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.}, interhash = {abc2f09f015cc983274a38543b5d3a15}, intrahash = {c3c959a9adc34eeae8fcf178e23d441b}, isbn = {1-55860-611-4}, keywords = {algorithms, and evolvable genetic hardware programming}, month = {13-17 July}, 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)}, pages = {982--989}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA 94104, USA}, timestamp = {2008-06-19T17:38:21.000+0200}, title = {What Makes a Problem {GP}-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-444.ps}, volume = 2, year = 1999 }