About: Evolutionary Design of Arbitrarily Large Sorting Networks Using Development

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

About: Evolutionary Design of Arbitrarily Large Sorting Networks Using Development 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	Článek popisuje metodu evolučního návrhu libovolně velkých řadicích sítí s využitím developmentu. (cs) An evolutionary algorithm is combined with an application-specific developmental scheme in order to evolve efficient arbitrarily large sorting networks. First, a small sorting network (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger sorting network (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the sorting network from tthe created larger sorting network and so on.<br>The proposed approach allowed us to rediscover the conventional principle of insertion which is traditionally used for constructing large sorting networks. Furthermore, the principle was improved by means of the evolutionary technique. The evolved sorting networks exhibit a lower implementation cost and delay. <br> An evolutionary algorithm is combined with an application-specific developmental scheme in order to evolve efficient arbitrarily large sorting networks. First, a small sorting network (that we call the embryo) has to be prepared to solve the trivial instance of a problem. Then the evolved program (the constructor) is applied on the embryo to create a larger sorting network (solving a larger instance of the problem). Then the same constructor is used to create a new instance of the sorting network from tthe created larger sorting network and so on.<br>The proposed approach allowed us to rediscover the conventional principle of insertion which is traditionally used for constructing large sorting networks. Furthermore, the principle was improved by means of the evolutionary technique. The evolved sorting networks exhibit a lower implementation cost and delay. <br> (en)
Title	Evolutionary Design of Arbitrarily Large Sorting Networks Using Development Evoluční návrh libovolně velkých řadicích sítí s využitím developmentu (cs) Evolutionary Design of Arbitrarily Large Sorting Networks Using Development (en)
skos:prefLabel	Evolutionary Design of Arbitrarily Large Sorting Networks Using Development Evoluční návrh libovolně velkých řadicích sítí s využitím developmentu (cs) Evolutionary Design of Arbitrarily Large Sorting Networks Using Development (en)
skos:notation	RIV/00216305:26230/05:PU55719!RIV06-GA0-26230___
http://linked.open.../vavai/riv/strany	319-347
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GP102/03/P004)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2006
http://linked.open...aciTvurceVysledku	Sekanina, Lukáš Bidlo, Michal
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	520829
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/05:PU55719
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	evolutionary algorithm, development, sorting network, scalability (en)
http://linked.open.../riv/klicoveSlovo	development evolutionary algorithm scalability sorting network
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[FF5D12AF3C97]
http://linked.open...i/riv/nazevZdroje	Genetic Programming and Evolvable Machines
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Evolvable hardware based applications design methods
http://linked.open...UplatneniVysledku	2005
http://linked.open...v/svazekPeriodika	6
http://linked.open...iv/tvurceVysledku	Sekanina, Lukáš Bidlo, Michal
issn	1389-2576
number of pages	29 (xsd:int)
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	Evolutionary Design of Arbitrarily Large Sorting Networks Using Development

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software