Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming

@inproceedings{Daida1997ChallengesWV,
  title={Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming},
  author={Jason M. Daida and Steven John Ross and Jeffrey J. Mcclain and Derrick S. Ampy and Michael Holczer},
  year={1997}
}
This paper discusses some of the difficulties involved in trying to make meaningful comparisons of results in genetic programming. To illustrate some of these difficulties, two studies involving the wall-following robot are featured. The paper subsequently offers several recommendations to address the issues demonstrated by these studies. conditions, but requires effectively infinite time. Her work is hailed by theoreticians in the field, but the practitioners still want a means to do on-the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

On Random Numbers And The Performance Of Genetic Algorithms

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Representation and structural difficulty in genetic programming

  • IEEE Transactions on Evolutionary Computation
  • 2006
VIEW 1 EXCERPT
CITES BACKGROUND

A Search Engine That Learns

  • Computational Intelligence
  • 2005
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES