Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis of Koza's   [HC] [CS]

by

Lang, K., J.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Proceedings of the Twelfth International Conference on Machine Learning (Conference proceedings), 1995
Keywords:genetic algorithms, genetic programming
Abstract:
Problem taken from chapter 9 of GP1. Shows hill climbing [HC] 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 koza:1995:hcbgs
Notes:
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry




BibTex:
@InProceedings{lang:1995:hcbgs,
  author =       "Kevin J. Lang",
  title =        "Hill Climbing Beats Genetic Search on a Boolean
                 Circuit Synthesis of {K}oza'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",
  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 koza:1995:hcbgs",
  notes =        "

                 ",
}