Solving Even-12, -13, -15, -17, -20 and -22 Boolean Parity Problems using Sub-machine Code GP with Smooth Uniform Crossover, Smooth Point Mutation and Demes

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

@TechReport{poli:1999:22parTR,

• author = "Riccardo Poli and Jonathan Page and William B. Langdon",
• title = "Solving Even-12, -13, -15, -17, -20 and -22 {Boolean} Parity Problems using Sub-machine Code GP with Smooth Uniform Crossover, Smooth Point Mutation and Demes",
• institution = "University of Birmingham, School of Computer Science",
• year = "1999",
• number = "CSRP-99-2",
• month = jan,
• keywords = "genetic algorithms, genetic programming",
• URL = "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1999/CSRP-99-02.ps.gz",
• abstract = "In this paper we describe a recipe to solve very large parity problems, using GP without automatically defined functions. The recipe includes three main ingredients: smooth uniform crossover (a crossover operator inspired by theoretical research), sub-machine-code GP (a technique which allows speeding up fitness evaluation in Boolean classification problems by nearly 2 orders of magnitude), and distributed demes (weakly interacting sub-populations running on separate workstations). We tested this recipe on parity problems with up to 22 input variables (i.e. where the fitness function includes 2^22=4,194,304 fitness cases), solving them with a very high success probability.",
• notes = "presented at GECCO-99 see \cite{poli:1999:22par}",

}

Genetic Programming entries for Riccardo Poli Jonathan Page William B Langdon

Citations