未找到相关数据
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
被引：48
作者：
Jason M. Daida
Robert R. Bertram
Stephen A. Stanhope
Jonathan C. Khoo
Shahbaz A. Chaudhary
Omer A. Chaudhri
John A. II Polito
机构：
[1] The University of Michigan,Artificial Intelligence Laboratory and Space Physics Research Laboratory
[2] Consilient,undefined
[3] Inc.,undefined
关键词：
problem difficulty;
test problems;
fitness landscapes;
GP theory;
D O I：
10.1023/A:1011504414730
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：165 / 191
页数：26
相关论文