This HTML5 document contains 46 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n10http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F10%3APU89591%21RIV12-GA0-26230___/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n12https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F10%3APU89591%21RIV12-GA0-26230___
rdf:type
skos:Concept n11:Vysledek
dcterms:description
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 considering fully functional but not necessarily smallest-discovered individual as the parent for new population can decrease the number of harmful mutations and so improve the search space exploration. This phenomenon was confirmed on common benchmarks such as combinational multipliers and the LGSynth91 circuits. 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 considering fully functional but not necessarily smallest-discovered individual as the parent for new population can decrease the number of harmful mutations and so improve the search space exploration. This phenomenon was confirmed on common benchmarks such as combinational multipliers and the LGSynth91 circuits.
dcterms:title
An Efficient Selection Strategy for Digital Circuit Evolution An Efficient Selection Strategy for Digital Circuit Evolution
skos:prefLabel
An Efficient Selection Strategy for Digital Circuit Evolution An Efficient Selection Strategy for Digital Circuit Evolution
skos:notation
RIV/00216305:26230/10:PU89591!RIV12-GA0-26230___
n3:aktivita
n4:Z n4:S n4:P
n3:aktivity
P(GAP103/10/1517), S, Z(MSM0021630528)
n3:dodaniDat
n19:2012
n3:domaciTvurceVysledku
n18:2192225 n18:7173873
n3:druhVysledku
n17:D
n3:duvernostUdaju
n22:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
246190
n3:idVysledku
RIV/00216305:26230/10:PU89591
n3:jazykVysledku
n13:eng
n3:klicovaSlova
digital circuit, cartesian genetic programming, circuit design, evolutionary computation, selection operator
n3:klicoveSlovo
n20:cartesian%20genetic%20programming n20:circuit%20design n20:selection%20operator n20:evolutionary%20computation n20:digital%20circuit
n3:kontrolniKodProRIV
[D8B17D384188]
n3:mistoKonaniAkce
York
n3:mistoVydani
Berlin
n3:nazevZdroje
Evolvable Systems: From Biology to Hardware
n3:obor
n14:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n15:GAP103%2F10%2F1517
n3:rokUplatneniVysledku
n19:2010
n3:tvurceVysledku
Sekanina, Lukáš Gajda, Zbyšek
n3:typAkce
n16:WRD
n3:zahajeniAkce
2010-09-06+02:00
n3:zamer
n21:MSM0021630528
s:numberOfPages
12
n10:hasPublisher
Springer-Verlag
n12:isbn
978-3-642-15322-8
n6:organizacniJednotka
26230