C. Ryan, M. O'Neill, and J. Collins. In proceedings of Mendel 1998: 4th International
Mendel Conference on Genetic Algorithms, Optimisation
Problems, Fuzzy Logic, Neural Networks, Rough Sets., page 111--119. Brno, Czech Republic, Technical University of Brno, Faculty of Mechanical
Engineering, (June 1998)
Abstract
We describe a Genetic Algorithm that can evolve
complete programs using a variable length linear genome
to govern the mapping of a Backus Naur Form grammar
definition to a program. Expressions and programs of
arbitrary complexity may be evolved. Our system,
Grammatical Evolution, has already been applied to a
symbolic regression problem. Here we apply our system
to find Trigonometric Identities for Cos2x.
In proceedings of Mendel 1998: 4th International
Mendel Conference on Genetic Algorithms, Optimisation
Problems, Fuzzy Logic, Neural Networks, Rough Sets.
year
1998
month
June 24-26
pages
111--119
publisher
Technical University of Brno, Faculty of Mechanical
Engineering
%0 Conference Paper
%1 Ryan:1998:mendle
%A Ryan, C.
%A O'Neill, M.
%A Collins, J. J.
%B In proceedings of Mendel 1998: 4th International
Mendel Conference on Genetic Algorithms, Optimisation
Problems, Fuzzy Logic, Neural Networks, Rough Sets.
%C Brno, Czech Republic
%D 1998
%I Technical University of Brno, Faculty of Mechanical
Engineering
%K algorithms, evolution genetic grammatical programming,
%P 111--119
%T Grammatical Evolution: Solving Trigonometric
Identities.
%U http://www.grammatical-evolution.org/papers/mendel98.ps
%X We describe a Genetic Algorithm that can evolve
complete programs using a variable length linear genome
to govern the mapping of a Backus Naur Form grammar
definition to a program. Expressions and programs of
arbitrary complexity may be evolved. Our system,
Grammatical Evolution, has already been applied to a
symbolic regression problem. Here we apply our system
to find Trigonometric Identities for Cos2x.
%@ 80-214-1199-6
@inproceedings{Ryan:1998:mendle,
abstract = {We describe a Genetic Algorithm that can evolve
complete programs using a variable length linear genome
to govern the mapping of a Backus Naur Form grammar
definition to a program. Expressions and programs of
arbitrary complexity may be evolved. Our system,
Grammatical Evolution, has already been applied to a
symbolic regression problem. Here we apply our system
to find Trigonometric Identities for Cos2x.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Brno, Czech Republic},
author = {Ryan, C. and O'Neill, M. and Collins, J. J.},
biburl = {https://www.bibsonomy.org/bibtex/27d90d33c0cff693b5f8ccb057638bd5d/brazovayeye},
booktitle = {In proceedings of Mendel 1998: 4th International
Mendel Conference on Genetic Algorithms, Optimisation
Problems, Fuzzy Logic, Neural Networks, Rough Sets.},
interhash = {15155a1f008f88e595540c40e380ffd3},
intrahash = {7d90d33c0cff693b5f8ccb057638bd5d},
isbn = {80-214-1199-6},
keywords = {algorithms, evolution genetic grammatical programming,},
month = {June 24-26},
pages = {111--119},
publisher = {Technical University of Brno, Faculty of Mechanical
Engineering},
timestamp = {2008-06-19T17:50:48.000+0200},
title = {Grammatical Evolution: Solving Trigonometric
Identities.},
url = {http://www.grammatical-evolution.org/papers/mendel98.ps},
year = 1998
}