W. Langdon. Genetic Programming 1996: Proceedings of the First
Annual Conference, page 141--148. Stanford University, CA, USA, MIT Press, (28--31 July 1996)
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.
%0 Conference Paper
%1 Langdon:1996:usedata
%A Langdon, W. B.
%B Genetic Programming 1996: Proceedings of the First
Annual Conference
%C Stanford University, CA, USA
%D 1996
%E Koza, John R.
%E Goldberg, David E.
%E Fogel, David B.
%E Riolo, Rick L.
%I MIT Press
%K (ADF), Artificial Automatic Automatically CFG, Data Defined Demes Dyck Evolution, Expressions, Functions Learning, Machine Object Oriented Pareto Polish Programming, Push Reverse Stack, Structures, algorithms, automatic brackets, code context down fitness, free generation, genetic grammar induction, language language, matched programming,
%P 141--148
%T Using Data Structures within Genetic Programming
%U http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.gp96.ps
%X 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.
@inproceedings{Langdon:1996:usedata,
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.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Stanford University, CA, USA},
author = {Langdon, W. B.},
biburl = {https://www.bibsonomy.org/bibtex/2236646275442c265c2b16ffaf04ad437/brazovayeye},
booktitle = {Genetic Programming 1996: Proceedings of the First
Annual Conference},
editor = {Koza, John R. and Goldberg, David E. and Fogel, David B. and Riolo, Rick L.},
interhash = {ef5b904f09b1956232b501d21898fb46},
intrahash = {236646275442c265c2b16ffaf04ad437},
keywords = {(ADF), Artificial Automatic Automatically CFG, Data Defined Demes Dyck Evolution, Expressions, Functions Learning, Machine Object Oriented Pareto Polish Programming, Push Reverse Stack, Structures, algorithms, automatic brackets, code context down fitness, free generation, genetic grammar induction, language language, matched programming,},
month = {28--31 July},
notes = {GP-96. Replaces \cite{Langdon:1996:usedataRN}},
pages = {141--148},
publisher = {MIT Press},
size = {9 pages},
timestamp = {2008-06-19T17:44:44.000+0200},
title = {Using Data Structures within Genetic Programming},
url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/WBL.gp96.ps},
year = 1996
}