123 search results - page 4 / 25 » A new crossover technique for Cartesian genetic programming |
EUROGP
2008
Springer
13 years 9 months ago
2008
Springer
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...
EUROGP
2004
Springer
14 years 25 days ago
2004
Springer
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...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
IICAI
2003
13 years 8 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
EUROGP
2009
Springer
14 years 2 months ago
2009
Springer
Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It is able to modify its own phenotype during execution of the evolved program. This is do...