.png){kind=icon}
Return
Grammatical evolution
.png){kind=icon}
PRE
AI
DOI：10.1109/4235.942529.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
automatic programming
Backus-Naur form
degenerate code
evolutionary algorithms
neutral networks
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
No organization information available
Cited Papers
Detection of dehydrin-like proteins in embryos and endosperm of mature Euterpe edulis seeds.png)
Protoplasma
ProtoplasmaIF0
PREAI
ShareSave
ShareSaveShareSaveShareSaveShareSaveEarly environment contributes to developmental disruption of MPFC after neonatal ventral hippocampal lesions in ratsSynapse
SynapseIF0
PREAI
ShareSaveShareSaveShareSave
ShareSave no more
no more