Using Data Structures within Genetic Programming

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

@InProceedings{Langdon:1996:usedata,
  author =       "W. B. Langdon",
  title =        "Using Data Structures within Genetic Programming",
  booktitle =    "Genetic Programming 1996: Proceedings of the First
                 Annual Conference",
  editor =       "John R. Koza and David E. Goldberg and 
                 David B. Fogel and Rick L. Riolo",
  year =         "1996",
  month =        "28--31 " # jul,
  keywords =     "genetic algorithms, genetic programming, context free
                 language induction, context free grammar CFG, matched
                 brackets, Dyck language, Reverse Polish Expressions,
                 automatic code generation, Automatic Programming,
                 Machine Learning, Artificial Evolution, Data
                 Structures, Object Oriented Programming, Push down
                 Stack, Automatically Defined Functions (ADF), Pareto
                 fitness, Demes",
  pages =        "141--148",
  address =      "Stanford University, CA, USA",
  publisher =    "MIT Press",
  URL =          "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.gp96.ps",
  URL =          "http://cognet.mit.edu/sites/default/files/books/9780262315876/pdfs/9780262315876_chap17.pdf",
  URL =          "http://cognet.mit.edu/library/books/view?isbn=0262611279",
  size =         "9 pages",
  abstract =     "Provision of appropriately structured memory is shown,
                 in some cases, to be advantageous to genetic
                 programming (GP) in comparison with directly
                 addressable indexed memory.

                 Three ``classic'' problems are solved. The first two
                 require the GP to distinguish between sentences that
                 are in a context free language and those that are not
                 given positive and negative training examples of the
                 language. The two languages are, correctly nested
                 brackets and a Dyck language (correctly nested brackets
                 of different types). The third problem is to evaluate
                 integer Reverse Polish (postfix)
                 expressions.

                 Comparisons are made between GP attempting to solve
                 these problems when provided with indexed memory or
                 with stack data structures.",
  notes =        "GP-96. Replaces \cite{Langdon:1996:usedataRN}",
}

Genetic Programming entries for William B Langdon

Citations