Genetic Programming Bibliography entries for Omar A Chaudhri

up to index Created by W.Langdon from gp-bibliography.bib Revision:1.8947

GP coauthors/coeditors: Jason M Daida, Jonathan Chew Hoe Khoo, Wendell S Richardson, Rachel B Harrison, William J Sloat, Derrick S Ampy, Michael Ratanasavetavadhana, Hsiaolei Li, Robert R Bertram, Stephen A Stanhope, Shahbaz A Chaudhary, John A Polito 2,

Genetic Programming Articles by Omar A Chaudhri

• Jason M. Daida and Robert R. Bertram and Stephen A. Stanhope and Jonathan C. Khoo and Shahbaz A. Chaudhary and Omer A. Chaudhri and John A. Polito II. 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. details

Genetic Programming conference papers by Omar A Chaudhri

• Omer A. Chaudhri and Jason M. Daida and Jonathan C. Khoo and Wendell S. Richardson and Rachel B. Harrison and William J. Sloat. Characterizing a Tunably Difficult Problem in Genetic Programming. In Darrell Whitley and David Goldberg and Erick Cantu-Paz and Lee Spector and Ian Parmee and Hans-Georg Beyer editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 395-402, Las Vegas, Nevada, USA, 2000. Morgan Kaufmann. details

• Jason M. Daida and Derrick S. Ampy and Michael Ratanasavetavadhana and Hsiaolei Li and Omar A. Chaudhri. Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic. In Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1851-1858, Orlando, Florida, USA, 1999. Morgan Kaufmann. details