Boosting Search for Recursive Functions Using Partial Call-Trees

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

@InProceedings{alexander2014boosting,
  author =       "Brad Alexander and Brad Zacher",
  title =        "Boosting Search for Recursive Functions Using Partial
                 Call-Trees",
  booktitle =    "13th International Conference on Parallel Problem
                 Solving from Nature",
  year =         "2014",
  editor =       "Thomas Bartz-Beielstein and Juergen Brank and 
                 Jim Smith",
  publisher =    "Springer",
  isbn13 =       "978-3-319-10761-5",
  pages =        "384--393",
  series =       "Lecture Notes in Computer Science",
  address =      "Ljubljana, Slovenia",
  month =        "13-17 " # sep,
  volume =       "8672",
  keywords =     "genetic algorithms, genetic programming, grammatical
                 evolution, Recursion, Call-Tree, Adaptive Grammar",
  DOI =          "doi:10.1007/978-3-319-10762-2_38",
  size =         "10 pages",
  abstract =     "Recursive functions are a compact and expressive way
                 to solve challenging problems in terms of local
                 processing. These properties have made recursive
                 functions a popular target for genetic programming.
                 Unfortunately, the evolution of substantial recursive
                 programs has proved difficult. One cause of this
                 problem is the difficulty in evolving both correct base
                 and recursive cases using just information derived from
                 running test cases. In this work we describe a
                 framework that exploits additional information in the
                 form of partial call-trees. Such trees - a by-product
                 of deriving input-output cases by hand - guides the
                 search process by allowing the separate evolution of
                 the recursive case. We show that the speed of evolution
                 of recursive functions is significantly enhanced by the
                 use of partial call-trees and demonstrate application
                 of the technique in the derivation of functions for a
                 suite of numerical functions.",
  notes =        "CTGGP, GE, GElib 0.26, tiny-c-compiler tcc, factorial,
                 oddevens, log2, fib2, fib3, lucas, factorings,
                 summands1 http://ppsn2014.ijs.si/

                 Cites \cite{Moraglio:2012:CEC} and
                 \cite{yu:1998:rlaGP98} (in both cases google scholar
                 Feb 2015 data wrong)",
}

Genetic Programming entries for Brad Alexander Brad Zacher

Citations