| Bookmark: |
Full-text
| URL: http://www.lania.mx/~ccoello/eurogp98.ps.gz |
| Cached: PDF-158K PS-284K PS.gz-67K |
| SAVE AS an easy-to-recall long filename: |
| Filename format: author--year--title PDF-158K PS-67K :: About GZip'd PS |
| Filename format: author--year--title--journal|proceedings|...--pages PDF-158K PS-67K |
Related links
| CiteSeer: http://citeseer.ist.psu.edu/ryan98grammatical.html |
| Web search: Google Web Search :: Google Scholar |
| Within this site: Cited by (4) References (14) |
Abstract
We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern how a Backus Naur Form grammar definition is mapped to a program, expressions and programs of arbitrary complexity may be evolved. Other automatic programming methods are described, before our system, Grammatical Evolution, is applied to a symbolic regression problem.BibTex
@inproceedings{ryan98grammaticalEvolution,
author={Conor Ryan and J. J. Collins and Michael O'Neill},
title={Grammatical Evolution: Evolving Programs for an Arbitrary Language},
year={1998},
pages={83-96},
booktitle={EuroGP 1998},
url={http://www.isrl.uiuc.edu/~amag/langev/paper/ryan98grammaticalEvolution.html}
}
| HOME :: Conference List :: Conference Paper | Comments to: junwang4 you-know-at gmail.com | Last update: 12/17/09 |