Author of the publication

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

, , , , , , and . Genetic Programming and Evolvable Machines, 2 (2): 165--191 (June 2001)
DOI: doi:10.1023/A:1011504414730

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

What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming., , , , , and . GECCO, page 982-989. Morgan Kaufmann, (1999)Analysis of Single-Node (Building) Blocks in Genetic Programming, , , and . Advances in Genetic Programming 3, chapter 10, MIT Press, Cambridge, MA, USA, (June 1999)What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming., , , , , , and . Genet. Program. Evolvable Mach., 2 (2): 165-191 (2001)What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming, , , , , , and . Genetic Programming and Evolvable Machines, 2 (2): 165--191 (June 2001)Reconstructing Incomplete Signals Using Nonlinear Interpolation and Genetic Algorithms, , , , and . Late Breaking Papers at the 1997 Genetic Programming Conference, page 19--27. Stanford University, CA, USA, Stanford Bookstore, (13--16 July 1997)Reconstructing Incomplete Signals Using Nonlinear Interpolation and Genetic Algorithms, , , , and . Genetic Programming 1998: Proceedings of the Third Annual Conference, page 447--454. University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann, (22-25 July 1998)Tagging as a Means for Self-Adaptive Hybridization, , , and . Late Breaking Papers at the 1997 Genetic Programming Conference, page 42--50. Stanford University, CA, USA, Stanford Bookstore, (13--16 July 1997)