Sciweavers

ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 1 months ago
An Efficient Selection Strategy for Digital Circuit Evolution
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
Zbysek Gajda, Lukás Sekanina
GPEM
2010
180views more  GPEM 2010»
13 years 2 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
13 years 4 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
13 years 5 months ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina
EUROGP
2008
Springer
137views Optimization» more  EUROGP 2008»
13 years 5 months ago
A Comparison of Cartesian Genetic Programming and Linear Genetic Programming
Two prominent genetic programming approaches are the graph-based Cartesian Genetic Programming (CGP) and Linear Genetic Programming (LGP). Recently, a formal algorithm for construc...
Garnett Carl Wilson, Wolfgang Banzhaf
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
13 years 7 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 7 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
13 years 8 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
EVOW
2004
Springer
13 years 9 months ago
Evolutionary Design Space Exploration for Median Circuits
This paper shows that it is possible to (1) discover novel implementations of median circuits using evolutionary techniques and (2) find out suitable median circuits in case that ...
Lukás Sekanina
EUROGP
2004
Springer
129views Optimization» more  EUROGP 2004»
13 years 9 months ago
Evolution and Acquisition of Modules in Cartesian Genetic Programming
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
James Alfred Walker, Julian Francis Miller