Dynamically Defined Functions In Grammatical
Evolution
R. Harper, and A. Blair. Proceedings of the 2006 IEEE Congress on Evolutionary
Computation, page 9188--9188. Vancouver, IEEE Press, (6-21 July 2006)
Abstract
Grammatical Evolution is an extension of Genetic
Programming, in that it is an algorithm for evolving
complete programs in an arbitrary language. a Backus
Naur Form grammar the advantages of typing are achieved
as well as a separation of genotype and phenotype.
introduces a meta-grammar into Grammatical Evolution
allowing the grammar to dynamically define functions,
self adaptively at the individual level without the
need for special purpose operators or constraints. The
user need not determine the architecture of the
dynamically defined functions. As the search proceeds
through genotype/phenotype space the number and use of
the functions can vary. The ability of the grammar to
dynamically define such functions allows regularities
in the problem space to be exploited even where such
regularities were not apparent when the problem was set
up.
%0 Conference Paper
%1 Harper_2006_CEC
%A Harper, Robin
%A Blair, Alan
%B Proceedings of the 2006 IEEE Congress on Evolutionary
Computation
%C Vancouver
%D 2006
%I IEEE Press
%K algorithms, evolution genetic grammatical programming,
%P 9188--9188
%T Dynamically Defined Functions In Grammatical
Evolution
%X Grammatical Evolution is an extension of Genetic
Programming, in that it is an algorithm for evolving
complete programs in an arbitrary language. a Backus
Naur Form grammar the advantages of typing are achieved
as well as a separation of genotype and phenotype.
introduces a meta-grammar into Grammatical Evolution
allowing the grammar to dynamically define functions,
self adaptively at the individual level without the
need for special purpose operators or constraints. The
user need not determine the architecture of the
dynamically defined functions. As the search proceeds
through genotype/phenotype space the number and use of
the functions can vary. The ability of the grammar to
dynamically define such functions allows regularities
in the problem space to be exploited even where such
regularities were not apparent when the problem was set
up.
%@ 0-7803-9487-9
@inproceedings{Harper_2006_CEC,
abstract = {Grammatical Evolution is an extension of Genetic
Programming, in that it is an algorithm for evolving
complete programs in an arbitrary language. a Backus
Naur Form grammar the advantages of typing are achieved
as well as a separation of genotype and phenotype.
introduces a meta-grammar into Grammatical Evolution
allowing the grammar to dynamically define functions,
self adaptively at the individual level without the
need for special purpose operators or constraints. The
user need not determine the architecture of the
dynamically defined functions. As the search proceeds
through genotype/phenotype space the number and use of
the functions can vary. The ability of the grammar to
dynamically define such functions allows regularities
in the problem space to be exploited even where such
regularities were not apparent when the problem was set
up.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Vancouver},
author = {Harper, Robin and Blair, Alan},
biburl = {https://www.bibsonomy.org/bibtex/2456e665d5f4b6cb29be3f6b6714828bb/brazovayeye},
booktitle = {Proceedings of the 2006 IEEE Congress on Evolutionary
Computation},
interhash = {596c199caa6280a8cdec92b61dc958b2},
intrahash = {456e665d5f4b6cb29be3f6b6714828bb},
isbn = {0-7803-9487-9},
keywords = {algorithms, evolution genetic grammatical programming,},
month = {6-21 July},
notes = {WCCI 2006 - A joint meeting of the IEEE, the EPS, and
the IEE.
minesweeper},
pages = {9188--9188},
publisher = {IEEE Press},
size = {8 pages},
timestamp = {2008-06-19T17:41:00.000+0200},
title = {Dynamically Defined Functions In Grammatical
Evolution},
year = 2006
}