A hierarchical approach to learning the boolean multiplexer function

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

  author =       "John R. Koza",
  title =        "A hierarchical approach to learning the boolean
                 multiplexer function",
  pages =        "171--192",
  editor =       "Gregory J. E. Rawlins",
  booktitle =    "Foundations of genetic algorithms",
  publisher =    "Morgan Kaufmann",
  publisher_address = "San Mateo, California, USA",
  year =         "1991",
  address =      "Indiana University",
  month =        "15-18 " # jul # " 1990",
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.genetic-programming.com/jkpdf/foga1990.pdf",
  abstract =     "This paper desribes the recently developed genetic
                 programming paradigm, which genetically breeds
                 populations of computer programs to solve problems. In
                 genetic programming, the individuals in the population
                 are hierarchical compositions of functions and
                 arguments. Each of these individual computer programs
                 is evaluated for its fitness in handling the
                 problemenvironment. The size and shape of the computer
                 program needed to solve the problem is not
                 predetermined by the user, but instead emerges from the
                 simulated evolutionary process driven by fitness. In
                 this paper, the operation of the genetic programming
                 paradigm is illustrated with the problem of learning
                 the boolean 11-multiplexer function.",
  notes =        "FOGA-90 Published in 1991",

Genetic Programming entries for John Koza