Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming

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

  author =       "Man Leung Wong",
  title =        "Evolving Recursive Programs by Using Adaptive Grammar
                 Based Genetic Programming",
  journal =      "Genetic Programming and Evolvable Machines",
  year =         "2005",
  volume =       "6",
  number =       "4",
  pages =        "421--455",
  month =        dec,
  keywords =     "genetic algorithms, genetic programming, grammar based
                 genetic programming, logic grammars, recursive
  ISSN =         "1389-2576",
  URL =          "http://cptra.ln.edu.hk/~mlwong/journal/gpem2005.pdf",
  DOI =          "doi:10.1007/s10710-005-4805-8",
  size =         "35 pages",
  abstract =     "Genetic programming (GP) extends traditional genetic
                 algorithms to automatically induce computer programs.
                 GP has been applied in a wide range of applications
                 such as software re-engineering, electrical circuits
                 synthesis, knowledge engineering, and data mining. One
                 of the most important and challenging research areas in
                 GP is the investigation of ways to successfully evolve
                 recursive programs. A recursive program is one that
                 calls itself either directly or indirectly through
                 other programs. Because recursions lead to compact and
                 general programs and provide a mechanism for reusing
                 program code, they facilitate GP to solve larger and
                 more complicated problems. Nevertheless, it is commonly
                 agreed that the recursive program learning problem is
                 very difficult for GP. In this paper, we propose
                 techniques to tackle the difficulties in learning
                 recursive programs. The techniques are incorporated
                 into an adaptive Grammar Based Genetic Programming
                 system (adaptive GBGP). A number of experiments have
                 been performed to demonstrate that the system improves
                 the effectiveness and efficiency in evolving recursive
  notes =        "An erratum to this article is available at
                 http://dx.doi.org/10.1007/s10710-006-7455-6 : 'The
                 publisher apologizes for an error that occurred in the
                 above mentioned article. The error appears in the
                 printed version, as well as in the html and pdf version
                 online. Man Leung Wong is the sole author of this

                 'contains logic gaols' genetic operations performed on
                 derivation tree, biases updated during run. Final
                 grammar better (easier to evolve solutions from) than
                 initial one, self adaption. non-terminating programs
                 direct selection of crossover points. 11-Mux. General
                 solution to even-n-parity. p452 GP outperformed random

Genetic Programming entries for Man Leung Wong