No Free Lunch, Program Induction and Combinatorial Problems

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

  author =       "John R. Woodward and James R. Neil",
  title =        "No Free Lunch, Program Induction and Combinatorial
  booktitle =    "Genetic Programming, Proceedings of EuroGP'2003",
  year =         "2003",
  editor =       "Conor Ryan and Terence Soule and Maarten Keijzer and 
                 Edward Tsang and Riccardo Poli and Ernesto Costa",
  volume =       "2610",
  series =       "LNCS",
  pages =        "475--484",
  address =      "Essex",
  publisher_address = "Berlin",
  month =        "14-16 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming: Poster",
  ISBN =         "3-540-00971-X",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.1007/3-540-36599-0_45",
  abstract =     "This paper has three aims. Firstly, to clarify the
                 poorly understood No Free Lunch Theorem (NFL) which
                 states all search algorithms perform equally. Secondly,
                 search algorithms are often applied to program
                 induction and it is suggested that NFL does not hold
                 due to the universal nature of the mapping between
                 program space and functionality space. Finally, NFL and
                 combinatorial problems are examined. When evaluating a
                 candidate solution, it can be discarded without being
                 fully examined. A stronger version of NFL is
                 established for this class of problems where the goal
                 is to minimize a quantity.",
  notes =        "EuroGP'2003 held in conjunction with EvoWorkshops

Genetic Programming entries for John R Woodward James R Neil