![]() | ![]() |
| 2001 | ||
|---|---|---|
| 2 | Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. Genetic Programming and Evolvable Machines 2(2): 165-191 (2001) | |
| 2000 | ||
| 1 | Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat: Characterizing a Tunably Difficult Problem in Genetic Programming. GECCO 2000: 395-402 | |
Data released under the ODC-BY 1.0 license — See also our legal information page