Data Structures and Genetic Programming

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

  author =       "W. B. Langdon",
  title =        "Data Structures and Genetic Programming",
  institution =  "University College London",
  year =         "1995",
  type =         "Research Note",
  number =       "RN/95/70",
  address =      "Gower Street, London WC1E 6BT, UK",
  month =        sep,
  keywords =     "genetic algorithms, genetic programming, list,
                 evolution, automatic code generation",
  URL =          "",
  abstract =     "In real world applications, software engineers
                 recognise the use of memory must be organised via data
                 structures and that software using the data must be
                 independant of the data structures' implementation
                 details. They achieve this by using abstract data
                 structures, such as records, files and buffers.

                 We demonstrate that genetic programming can
                 automatically implement simple abstract data
                 structures, considering in detail the task of evolving
                 a list. We show general and reasonably efficient
                 implementations can be automatically generated from
                 simple primitives.

                 A model for maintaining evolved code is demonstrated
                 using the list problem.

                 4 page early abstract at
  notes =        "As \cite{langdon:1996:aigp2} Syntax rules restrict for
                 while loops so they are not nested. Run time data used
                 to guide location of crossover points CPU and memory
                 usage included in fitness via Pareto tournament
                 selection. Pass by reference and call by reference used
                 inconjunction with ADFs. Scoping rules allow ADFs
                 access to callers data.",
  size =         "20 pages",

Genetic Programming entries for William B Langdon