Evolving Recursive Programs for Tree Search   [TS]

by

Brave, S.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Advances in Genetic Programming 2, 1996, p. 203-220
Keywords:genetic algorithms, genetic programming
Notes:
Recursive ADFs, non-recursive ADFs and non-ADF GP compared on a tree searching problem. Tree depths 2-7 (ie up to 127 leaf nodes) containing one goal node. Problem arranged so can only be solved (by luck?) or by using memory. READ+WRITE update a single memory cell per tree node, ie no index, just access current cell. WRITE not as Teller but returns its argument. ADF1 and ADF2 syntax set up so one can search tree and one can move within it, cf. Andre. Recursive ADFs much better than ADFs much better than non-ADFs, difference increase as tree size increases. "random"? program search can find recursive ADF programs which solve problem.
Internet search:Search Google
Search Google Scholar
Search Citeseer using Google
Search Google for PDF
Search Google Scholar for PDF
Search Citeseer for PDF using Google

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InCollection{brave:1996:aigp2,
  author =       "Scott Brave",
  title =        "Evolving Recursive Programs for Tree Search",
  booktitle =    "Advances in Genetic Programming 2",
  publisher =    "MIT Press",
  year =         "1996",
  editor =       "Peter J. Angeline and K. E. {Kinnear, Jr.}",
  pages =        "203--220",
  chapter =      "10",
  address =      "Cambridge, MA, USA",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "0-262-01158-1",
  notes =        "Recursive ADFs, non-recursive ADFs and non-ADF GP
                 compared on a tree searching problem. Tree depths 2-7
                 (ie up to 127 leaf nodes) containing one goal node.
                 Problem arranged so can only be solved (by luck?) or by
                 using memory. READ+WRITE update a single memory cell
                 per tree node, ie no index, just access current cell.
                 WRITE not as Teller but returns its argument. ADF1 and
                 ADF2 syntax set up so one can search tree and one can
                 move within it, cf. Andre.

                 Recursive ADFs much better than ADFs much better than
                 non-ADFs, difference increase as tree size increases.
                 {"}random{"}? program search can find recursive ADF
                 programs which solve problem.",
  size =         "17 pages",
}