- CSB - MetaPress - Google - Bing - Yahoo
 | 2001 | |
|---|---|---|
| j1 |      | 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 | ||
| c2 |  | 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 |
| 1999 | ||
| c1 | | Jason M. Daida, John Polito, Steven A. Stanhope, Robert R. Bertram, Jonathan C. Khoo, Shahbaz A. Chaudhary: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming. GECCO 1999: 982-989 |
| 1 | Robert R. Bertram | |
| 2 | Shahbaz A. Chaudhary | |
| 3 | Omer A. Chaudhri | |
| 4 | Jason M. Daida | |
| 5 | Rachel Harrison | |
| 6 | John Polito | |
| 7 | Wendell S. Richardsons | |
| 8 | William J. Sloat | |
| 9 | Stephen A. Stanhope | |
| 10 | Steven A. Stanhope |
Data released under the ODC-BY 1.0 license — See also our legal information page