Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis of Koza's

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

@InProceedings{lang:1995:hcbgs,

• author = "Kevin J. Lang",
• title = "Hill Climbing Beats Genetic Search on a {Boolean} Circuit Synthesis of {Koza's}",
• booktitle = "Proceedings of the Twelfth International Conference on Machine Learning",
• year = "1995",
• address = "Tahoe City, California, USA",
• publisher_address = "San Francisco, CA, USA",
• month = jul,
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://www.genetic-programming.com/lang-ml95.ps",
• size = "4 pages",
• abstract = "Problem taken from chapter 9 of GP1. Shows hill climbing more efficient than GP on this problem. Speculates that (for this problem) fragments of high fitness individuals have no special value when transplanted into other individuals.

  See also \cite{koza:1995:hcbgs}",

• notes = "

  ",

}

Genetic Programming entries for Kevin J Lang

Citations