Using Building Block Functions to Investigate a Building Block Hypothesis for Genetic Programming

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

@TechReport{OReilly:1992:ubbf,
  author =       "Una-May O'Reilly and Franz Oppacher",
  title =        "Using Building Block Functions to Investigate a
                 Building Block Hypothesis for Genetic Programming",
  institution =  "Santa Fe Institute",
  year =         "1994",
  type =         "Working Paper",
  number =       "94-02-029",
  address =      "1399 Hyde Park Road Santa Fe, New Mexico 87501-8943
                 USA

                 ",
  month =        "13 " # apr,
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.santafe.edu/media/workingpapers/94-04-020.pdf",
  size =         "15 pages",
  abstract =     "This paper presents building block functions, i.e.,
                 functions in which explicit schemas of high fitness are
                 defined (BB functions, for short) which are useful in
                 investigating the character of Genetic Programming
                 search. One conjecture we believe to be answerable
                 through experimentation with these functions is whether
                 GP exploits building blocks. That is, is one
                 explanation for GP's power that, when primary partial
                 solutions are discovered, their numbers increase and GP
                 crossover is able to combine them into increasingly
                 larger sub-solutions and eventually find the solution?
                 The functions should also provide insight into more
                 details aspects of the roles of GP crossover and GP
                 genotype growth",
  notes =        "Working report

                 ",
}

Genetic Programming entries for Una-May O'Reilly Franz Oppacher

Citations