![]() |
| 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 | |
| 1 | Robert R. Bertram | [2] |
| 2 | Shahbaz A. Chaudhary | [2] |
| 3 | Jason M. Daida | [1] [2] |
| 4 | Rachel Harrison | [1] |
| 5 | Jonathan C. Khoo | [1] [2] |
| 6 | John Polito | [2] |
| 7 | Wendell S. Richardsons | [1] |
| 8 | William J. Sloat | [1] |
| 9 | Stephen A. Stanhope | [2] |