Solving High-Order Boolean Parity Problems with Smooth Uniform Crossover, Sub-Machine Code GP and Demes

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

@Article{poli:2000:22par,
  author =       "Riccardo Poli and Jonathan Page",
  title =        "Solving High-Order {Boolean} Parity Problems with
                 Smooth Uniform Crossover, Sub-Machine Code {GP} and
                 Demes",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2000",
  volume =       "1",
  number =       "1/2",
  pages =        "37--56",
  month =        apr,
  keywords =     "genetic algorithms, genetic programming, uniform
                 crossover, subsymbolic representation, sub-machine-code
                 gp, demes, parity problems",
  ISSN =         "1389-2576",
  doi =          "doi:10.1023/A:1010068314282",
  URL =          "http://citeseer.ist.psu.edu/335584.html",
  abstract =     "We propose and study new search operators and a novel
                 node representation that can make GP fitness landscapes
                 smoother. Together with a tree evaluation method known
                 as sub-machine-code GP and the use of demes, these make
                 up a recipe for solving very large parity problems
                 using GP. We tested this recipe on parity problems with
                 up to 22 input variables, solving them with a very high
                 success probability.",
  notes =        "poli:2000:22par, Article ID: 253704",
}

Genetic Programming entries for Riccardo Poli Jonathan Page