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

An Individually Variable Mutation-Rate Strategy for Genetic Algorithms, and . Late Breaking Papers at the Genetic Programming 1996 Conference Stanford University July 28-31, 1996, page 177--185. Stanford University, CA, USA, Stanford Bookstore, (28--31 July 1996)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)Symbionticism and Complex Adaptive Systems I: Implications of Having Symbiosis Occur in Nature., , , and . Evolutionary Programming, page 177-186. MIT Press, (1996)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)Genetic Programming for Target Classification and Identification in Synthetic Aperture Radar Imagery, and . Late Breaking Papers at the 1997 Genetic Programming Conference, page 224--230. Stanford University, CA, USA, Stanford Bookstore, (13--16 July 1997)Genetic Programming for Automatic Target Classification and Recognition., and . Evolutionary Programming, volume 1447 of Lecture Notes in Computer Science, page 735-744. Springer, (1998)An Individually Variable Mutation-Rate Strategy for Genetic Algorithms., and . Evolutionary Programming, volume 1213 of Lecture Notes in Computer Science, page 235-246. Springer, (1997)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)Evolution strategies for multivariate-to-anything partially specified random vector generation.. IEEE Congress on Evolutionary Computation, page 2235-2240. IEEE, (2004)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)