Random Search is Parsimonious

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

  author =       "W. B. Langdon",
  title =        "Random Search is Parsimonious",
  booktitle =    "Late Breaking Papers at the Genetic and Evolutionary
                 Computation Conference ({GECCO-2002})",
  year =         "2002",
  editor =       "Erick Cant{\'u}-Paz",
  pages =        "308--315",
  address =      "New York, NY",
  publisher =    "AAAI",
  publisher_address = "445 Burgess Drive, Menlo Park, CA 94025",
  month =        "9-13 " # jul,
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2002lb.pdf",
  URL =          "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2002lb.ps.gz",
  size =         "8 pages",
  abstract =     "We model in detail the distribution of Boolean
                 functions implemented by random non-recursive programs,
                 similar to linear genetic programming. Most functions
                 are constants, the remainder are mostly simple. Bounds
                 on how long programs need to be before the distribution
                 of their functionality is close to its limiting
                 distribution are provided in general and for average
  notes =        "Late Breaking Papers, {GECCO-2002}. A joint meeting of
                 the eleventh International Conference on Genetic
                 Algorithms ({ICGA-2002}) and the seventh Annual Genetic
                 Programming Conference ({GP-2002}) part of

                 Superseded by \cite{langdon:2002:foga}",

Genetic Programming entries for William B Langdon