2001 |
3 | | 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 |
2 | | 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 |
1 | | 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 |