Cartesian genetic programming for memristive logic circuits

Howard, G. D., Bull, L. and Adamatzky, A. (2012) Cartesian genetic programming for memristive logic circuits. In: (2012) Genetic Programming. (7244) Springer Berlin/Heidelberg, pp. 37-48. ISBN 9783642291388 Available from: http://eprints.uwe.ac.uk/20734

Full text not available from this repository

Publisher's URL: http://www.springerlink.com

Abstract/Description

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.

Item Type:Book Section
Uncontrolled Keywords:information systems applications, internet, computational biology, bioinformatics, computation, abstract devices, computer science, programming techniques, artificial intelligence, AI, robotics
Faculty/Department:Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
ID Code:20734
Deposited By: M. Clarke
Deposited On:15 Jul 2013 10:40
Last Modified:12 Apr 2016 12:19

Request a change to this item