What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
dc.contributor.author | Daida, Jason M. | en_US |
dc.contributor.author | Bertram, Robert R. | en_US |
dc.contributor.author | Stanhope, Stephen A. | en_US |
dc.contributor.author | Khoo, Jonathan C. | en_US |
dc.contributor.author | Chaudhary, Shahbaz A. | en_US |
dc.contributor.author | Chaudhri, Omer A. | en_US |
dc.contributor.author | Polito, John A. II. | en_US |
dc.date.accessioned | 2006-09-11T16:15:58Z | |
dc.date.available | 2006-09-11T16:15:58Z | |
dc.date.issued | 2001-06 | en_US |
dc.identifier.citation | Daida, Jason M.; Bertram, Robert R.; Stanhope, Stephen A.; Khoo, Jonathan C.; Chaudhary, Shahbaz A.; Chaudhri, Omer A.; Polito, John A. II; (2001). "What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming." Genetic Programming and Evolvable Machines 2(2): 165-191. <http://hdl.handle.net/2027.42/45613> | en_US |
dc.identifier.issn | 1389-2576 | en_US |
dc.identifier.issn | 1573-7632 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45613 | |
dc.description.abstract | This paper addresses the issue of what makes a problem genetic programming (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 indicate that, at least for this problem, the metaphor is misleading. | en_US |
dc.format.extent | 431054 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Computer Science | en_US |
dc.subject.other | Software Engineering/Programming and Operating Systems | en_US |
dc.subject.other | Programming Languages, Compilers, Interpreters | en_US |
dc.subject.other | Artificial Intelligence (Incl. Robotics) | en_US |
dc.subject.other | Problem Difficulty | en_US |
dc.subject.other | Test Problems | en_US |
dc.subject.other | Fitness Landscapes | en_US |
dc.subject.other | GP Theory | en_US |
dc.title | What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationum | Artificial Intelligence Laboratory and Space Physics Research Laboratory, The University of Michigan, 2455 Hayward Avenue, Ann Arbor, MI, 48109-2143, USA | en_US |
dc.contributor.affiliationother | Consilient, Inc., 1815 4th Street, Suite B, Berkeley, CA, 94710, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45613/1/10710_2004_Article_335714.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1011504414730 | en_US |
dc.identifier.source | Genetic Programming and Evolvable Machines | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.