Sciweavers

37 search results - page 6 / 8
» Self-modifying cartesian genetic programming
Sort
View
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 1 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
EVOW
2004
Springer
14 years 26 days 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
ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 5 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
EH
2004
IEEE
107views Hardware» more  EH 2004»
13 years 11 months ago
Evolving Digital Circuits using Multi Expression Programming
Multi Expression Programming (MEP) is a Genetic Programming (GP) variant that uses linear chromosomes for solution encoding. A unique MEP feature is its ability of encoding multipl...
Mihai Oltean, Crina Grosan
CEC
2009
IEEE
14 years 2 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney