Recombinative Hill-Climbing: A Stronger Search Method for Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Hooper:1997:rhc,

• author = "Dale C. Hooper and Nicholas S. Flann and Stephanie R. Fuller",
• title = "Recombinative Hill-Climbing: A Stronger Search Method for Genetic Programming",
• booktitle = "Genetic Programming 1997: Proceedings of the Second Annual Conference",
• editor = "John R. Koza and Kalyanmoy Deb and Marco Dorigo and David B. Fogel and Max Garzon and Hitoshi Iba and Rick L. Riolo",
• year = "1997",
• month = "13-16 " # jul,
• keywords = "genetic algorithms, genetic programming",
• pages = "174--179",
• address = "Stanford University, CA, USA",
• publisher_address = "San Francisco, CA, USA",
• publisher = "Morgan Kaufmann",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gp1997/Hooper_1997_rhc.pdf",
• size = "6 pages",
• notes = "GP-97 Artificial Ant Santa Fe trail (only 400 time steps p177), Symbolic regression pi*x**2+ex+x**0.5 {"}RHC is shown to run about ten times faster than traditional GP for the same population size{"} p175 NB only on symbolic regression. Optional program simplification (cites \cite{hooper:1996:iarGPes}) 0.5% mutation. Overfitting.",

}

Genetic Programming entries for Dale C Hooper Nicholas S Flann Stephanie R Fuller

Citations