Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study

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

@TechReport{page:CSRP-98-20,
  author =       "Jonathan Page and Riccardo Poli and 
                 William B. Langdon",
  title =        "Smooth Uniform Crossover with Smooth Point Mutation in
                 Genetic Programming: {A} Preliminary Study",
  institution =  "University of Birmingham, School of Computer Science",
  number =       "CSRP-98-20",
  month =        dec,
  year =         "1998",
  file =         "/1998/CSRP-98-20.ps.gz",
  URL =          "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-20.ps.gz",
  ftpaddress =   "ftp.cs.bham.ac.uk",
  reportfilename = "pub/tech-reports/1998/CSRP-98-20.ps.gz",
  keywords =     "genetic algorithms, genetic programming",
  abstract =     "we examine the behaviour of the uniform crossover and
                 point mutation GP operators on the even-n-parity
                 problem for n = 3, 4, 6 and present a novel
                 representation of function nodes, designed to allow the
                 search operators to make smaller movements around the
                 solution space. Using this representation, performance
                 on the even-6-parity problem is improved by three
                 orders of magnitude relative to the estimate given for
                 standard GP.",
}

Genetic Programming entries for Jonathan Page Riccardo Poli William B Langdon