返回
摘要
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.
Keyword:
automatic programming
Backus-Naur form
degenerate code
evolutionary algorithms
neutral networks
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
Detection of dehydrin-like proteins in embryos and endosperm of mature Euterpe edulis seeds
Protoplasma
IF0
Early environment contributes to developmental disruption of MPFC after neonatal ventral hippocampal lesions in rats
Synapse
IF0
没有更多内容

