Author of the publication

What Makes a Problem GP-Hard? A Look at How Structure Affects Content

. Genetic Programming Theory and Practice, chapter 7, Kluwer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Classification of Spectral Image Using Genetic Programming., , and . GECCO, page 726-733. Morgan Kaufmann, (2000)A Platform-Independent Collaborative Interface for Genetic Programming Applications: Image Analysis for Scientific Inquiry, , , and . Late Breaking Papers at the Genetic Programming 1996 Conference Stanford University July 28-31, 1996, page 1--8. Stanford University, CA, USA, Stanford Bookstore, (28--31 July 1996)Parameter Sweeps for Exploring Parameters Spaces of Genetic and Evolutionary Algorithms, , and . Parameter Setting in Evolutionary Algorithms, chapter 8, Springer, (2007)Genetic Programming for Automatic Target Classification and Recognition in Synthetic Aperture Radar Imagery, and . Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming, volume 1447 of LNCS, page 735--744. Mission Valley Marriott, San Diego, California, USA, Springer-Verlag, (25-27 March 1998)What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes., , , and . GECCO, volume 2724 of Lecture Notes in Computer Science, page 1665-1677. Springer, (2003)Visualizing Tree Structures in Genetic Programming., , , and . GECCO, volume 2724 of Lecture Notes in Computer Science, page 1652-1664. Springer, (2003)Symbionticism and Complex Adaptive Systems I: Implications of Having Symbiosis Occur in Nature., , , and . Evolutionary Programming, page 177-186. MIT Press, (1996)Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic., , , , and . GECCO, page 1851-1858. Morgan Kaufmann, (1999)What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming., , , , , and . GECCO, page 982-989. Morgan Kaufmann, (1999)Characterizing the dynamics of symmetry breaking in genetic programming.. GECCO, page 799-806. ACM, (2006)