Cartesian Genetic Programming for Memristive Logic Circuits

Cartesian Genetic Programming for Memristive Logic Circuits
复制标题

忆阻逻辑电路的笛卡尔遗传编程

DOI:
--
复制
发表时间:
2012
期刊:
European Conference on Genetic Programming
影响因子:
--
通讯作者:
A. Adamatzky
A. Adamatzky
中科院分区:
--
文献类型:
--
作者:
G. Howard;L. Bull;A. Adamatzky

文献摘要

参考文献

被引文献

相似文献

在本文中,忆阻逻辑电路的进化使用笛卡尔遗传编程。图包括蕴涵逻辑(IMP)节点相比,更普遍的NAND电路的逻辑电路问题和机器人控制任务的数量。自适应搜索参数用于提供每个图的相对变异率的自主性。结果表明,虽然NAND逻辑图更容易演变,但IMP图在(i)所需的忆阻器数量(ii)处理图所需的时间方面具有优势。
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.
DOI: 10.1007/978-3-642-11282-9_31
发表时间: 2010
期刊: --
影响因子: --
作者:
Tiwari A
通讯作者: Tiwari A