BibSonomy :: bibtex  ::

tag user group author concept BibTeX key search:all search:brazovayeye
A blue social bookmark and publication sharing system.
tags · relations · groups · popular
help · blog · about
login · register
brazovayeye's BibTeX entry:  

Changing the Genospace: Solving GA Problems with Cartesian Genetic Programming

Proceedings of the 10th European Conference on Genetic Programming, 4445: 261--270, 2007.
Authors: James Alfred Walker and Julian Francis Miller
Editors: Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar
Tags: algorithms, genetic programming
Abstract: Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally associated with Genetic Algorithms. Our approach uses CGP and ECGP to evolve a sequence of commands for a tape-head, which produces an arbitrary length binary string on a piece of tape. Computational effort figures are calculated for CGP and ECGP and our results compare favourably with those of Genetic Algorithms.
| BibTeX  
@inproceedings{eurogp07:jwalker2,
title = {Changing the Genospace: Solving {GA} Problems with Cartesian Genetic Programming},
address = {Valencia, Spain},
author = {James Alfred Walker and Julian Francis Miller},
booktitle = {Proceedings of the 10th European Conference on Genetic Programming},
editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar},
month = {11 - 13 April},
pages = {261--270},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4445},
year = {2007},
abstract = {Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally associated with Genetic Algorithms. Our approach uses CGP and ECGP to evolve a sequence of commands for a tape-head, which produces an arbitrary length binary string on a piece of tape. Computational effort figures are calculated for CGP and ECGP and our results compare favourably with those of Genetic Algorithms.},
isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_24},
keywords = {algorithms, genetic programming }
}