About: Cartesian Genetic Programming as Local Optimizer of Logic Networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Cartesian Genetic Programming as Local Optimizer of Logic Networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Logic synthesis and optimization methods work either globally on the whole logic network or locally on preselected subnetworks. Evolutionary design methods have already been applied to evolve and optimize logic circuits at the global level. In this paper, we propose a new method based on Cartesian genetic programming (CGP) as a local area optimizer in combinational logic networks. First, a subcircuit is extracted from a complex circuit, then the subcircuit is optimized by CGP and finally the optimized subcircuit replaces the original one. The procedure is repeated until a termination criterion is satisfied. We present a performance comparison of local and global evolutionary optimization methods with a conventional approach based on ABC and analyze these methods using differently pre-optimized benchmark circuits. If a sufficient time is available, the proposed locally optimizing CGP gives better results than other locally operating methods reported in the literature; however, its performan Logic synthesis and optimization methods work either globally on the whole logic network or locally on preselected subnetworks. Evolutionary design methods have already been applied to evolve and optimize logic circuits at the global level. In this paper, we propose a new method based on Cartesian genetic programming (CGP) as a local area optimizer in combinational logic networks. First, a subcircuit is extracted from a complex circuit, then the subcircuit is optimized by CGP and finally the optimized subcircuit replaces the original one. The procedure is repeated until a termination criterion is satisfied. We present a performance comparison of local and global evolutionary optimization methods with a conventional approach based on ABC and analyze these methods using differently pre-optimized benchmark circuits. If a sufficient time is available, the proposed locally optimizing CGP gives better results than other locally operating methods reported in the literature; however, its performan (en)
Title	Cartesian Genetic Programming as Local Optimizer of Logic Networks Cartesian Genetic Programming as Local Optimizer of Logic Networks (en)
skos:prefLabel	Cartesian Genetic Programming as Local Optimizer of Logic Networks Cartesian Genetic Programming as Local Optimizer of Logic Networks (en)
skos:notation	RIV/00216305:26230/14:PU111924!RIV15-GA0-26230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GA14-04197S)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Pták, Ondřej Vašíček, Zdeněk Sekanina, Lukáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	6248
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/14:PU111924
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	logic network, cartesian genetic programming, optimization, digital circuit (en)
http://linked.open.../riv/klicoveSlovo	digital circuit optimization logic network cartesian genetic programming
http://linked.open...ontrolniKodProRIV	[9E67303E6DE3]
http://linked.open...v/mistoKonaniAkce	Beijing
http://linked.open...i/riv/mistoVydani	Beijing
http://linked.open...i/riv/nazevZdroje	2014 IEEE Congress on Evolutionary Computation
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Advanced Methods for Evolutionary Design of Complex Digital Circuits
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Sekanina, Lukáš Vašíček, Zdeněk Pták, Ondřej
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-07-06 (xsd:date)
number of pages	8 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/CEC.2014.6900326
http://purl.org/ne...btex#hasPublisher	IEEE Computational Intelligence Society
https://schema.org/isbn	978-1-4799-1488-3
http://localhost/t...ganizacniJednotka	26230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software