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 . Genetic Programming and Evolvable Machines, 2 (2): 165--191 (June 2001)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)Characterizing a Tunably Difficult Problem in Genetic Programming, , , , , and . Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), page 395--402. Las Vegas, Nevada, USA, Morgan Kaufmann, (10-12 July 2000)