Now showing items 1-2 of 2
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
(Kluwer Academic Publishers; Springer Science+Business Media, 2001-06)
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 ...
Visualizing Tree Structures in Genetic Programming
(Kluwer Academic Publishers; Springer Science + Business Media, Inc., 2005-03)
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees even though several thousands of nodes may be involved. ...