What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming Export

@article{citeulike:2841868, 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.}, author = {Daida, J. M. and Bertram, R. R. and Stanhope, S. A. and Khoo, J. C. and Chaudhary, S. A. and Chaudhri, O. A. and Polito, J. A. I.}, citeulike-article-id = {2841868}, citeulike-linkout-0 = {http://www.ingentaconnect.com/content/klu/genp/2001/00000002/00000002/00335714}, issn = {1389-2576}, journal = {Genetic Programming and Evolvable Machines}, keywords = {01, gp-hard}, month = {June}, pages = {165--191}, posted-at = {2008-11-10 15:58:00}, priority = {2}, publisher = {Springer}, title = {What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming}, url = {http://www.ingentaconnect.com/content/klu/genp/2001/00000002/00000002/00335714}, year = {2001} }

TY - JOUR ID - citeulike:2841868 L3 - citeulike-article-id:2841868 N2 - 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. JF - Genetic Programming and Evolvable Machines SN - 1389-2576 EP - 191 TI - What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming PB - Springer SP - 165 KW - 01 KW - gp-hard AU - Daida, JM AU - Bertram, RR AU - Stanhope, SA AU - Khoo, JC AU - Chaudhary, SA AU - Chaudhri, OA AU - Polito, JAI PY - 2001/06// UR - http://www.ingentaconnect.com/content/klu/genp/2001/00000002/00000002/00335714 ER -