Complexity Compression and Evolution - Nordin, Banzhaf (1995)(Correct)(80 citations)
short, elegant and general solutions in a genetic programming system and other variable length
of Evolutionary Algorithms in general, and Genetic Programming in particular, is that they have the built lumpi.informatik.uni-dortmund.de/pub/biocomp/papers/icga95-1.ps.gz
Issues in Evolutionary Robotics - Harvey, Husbands, Cliff (1993)(Correct)(58 citations)
a different evolutionary approach, using genetic programming (9)Straightforward Genetic Algorithms
Brooks proposes using an extension of Koza's genetic programming techniques (18) as the method for evolving coast.cs.purdue.edu/pub/doc/genetic_algorithms/apps/Issues-Evolutionary-Robotics.ps.Z
Stochastic Hillclimbing as a Baseline Method for Evaluating.. - Juels, Wattenberg (1994)(Correct)(38 citations)
three classical NP-complete problems and a genetic programming problem. Second, we consider hillclimbing
markedly superior to that of the GA. 3.3 Genetic ProgrammingGenetic programming" GP) is a method of
superior to that of the GA. 3.3 Genetic ProgrammingGenetic programming" GP) is a method of enabling www.cse.cuhk.edu.hk/pub/EC/GA/papers/csd94-834.ps.gz
Silicon Evolution - Thompson (1996)(Correct)(37 citations)
Proceedings of Genetic Programming 1996 (GP96)J.R. Koza et al. Eds)pages
2 (1)73-110. de Garis, H. 1991)Genetic programming :Artificial nervous systems, artificial www.bioele.nuee.nagoya-u.ac.jp/wsc1/papers/files/thompson1.ps.gz