@article{oneill:2001:TEC,
title = {Grammatical Evolution},
author = {Michael O'Neill and Conor Ryan},
journal = {IEEE Transactions on Evolutionary Computation},
month = {August},
number = {4},
pages = {349--358},
volume = {5},
year = {2001},
abstract = {We present grammatical evolution, an evolutionary
algorithm that can evolve complete programs in an
arbitrary language using a variable-length binary
string. The binary genome determines which production
rules in a Backus-Naur form grammar definition are used
in a genotype-to-phenotype mapping process to a
program. We demonstrate how expressions and programs of
arbitrary complexity may be evolved and compare its
performance to genetic programming},
issn = {1089-778X}, size = {10 pages}, notes = {URL broken 7 June 2003}, doi = {doi:10.1109/4235.942529},
keywords = {Crossover, Genome, Genotype-Phenotype Grammar, Linear Mapping, algorithms, automatic complexity computational evolution, genetic grammatical programming, }
}
::