Cartesian genetic programming for memristive logic circuits

Authors:
Gerard David Howard;Larry Bull;Andrew Adamatzky
Affiliations:
University of the West of England, UK;University of the West of England, UK;University of the West of England, UK
Venue:
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
Year:
2012

Citing 7
Cited 0

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Cartesian Genetic Programming

Proceedings of the European Conference on Genetic Programming
Nonvolatile memristor memory: device characteristics and design implications

Proceedings of the 2009 International Conference on Computer-Aided Design
Self modifying cartesian genetic programming: parity

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Evolution of robot controller using cartesian genetic programming

EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Redundancy and computational efficiency in Cartesian genetic programming

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper memristive logic circuits are evolved using Cartesian Genetic Programming. Graphs comprised of implication logic (IMP) nodes are compared to more ubiquitous NAND circuitry on a number of logic circuit problems and a robotic control task. Self-adaptive search parameters are used to provide each graph with autonomy with respect to its relative mutation rates. Results demonstrate that, although NAND-logic graphs are easier to evolve, IMP graphs carry benefits in terms of (i) numbers of memristors required (ii) the time required to process the graphs.