Omer A. Chaudhri

According to our database, Omer A. Chaudhri authored at least 2 papers between 2000 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2001

What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.

Jason M. Daida, Robert R. Bertram, Stephen A. Stanhope, Jonathan C. Khoo, Shahbaz A. Chaudhary, Omer A. Chaudhri, John Polito

Genet. Program. Evolvable Mach., 2001

2000

Characterizing a Tunably Difficult Problem in Genetic Programming.

Omer A. Chaudhri, Jason M. Daida, Jonathan C. Khoo, Wendell S. Richardsons, Rachel Harrison, William J. Sloat

Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000