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

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

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n16http://localhost/temp/predkladatel/
n11http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
n15https://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#
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26230%2F04%3APU49220%21RIV11-MSM-26230___/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26230%2F04%3APU49220%21RIV11-MSM-26230___
rdf:type
skos:Concept n20:Vysledek
dcterms:description
In this paper we present an approach for constructing sorting networks of the arbitrary number of inputs. Genetic algorithm is used to find a constructor that would be able to build arbitrarily large sorting network. The crucial part of the process is the so-called development inspired by biological ontogeny which means that the larger sorting network is created on the basis of its precursor according to the given rules. It is shown that these rules can be designed using genetic algorithm.<br> In this paper we present an approach for constructing sorting networks of the arbitrary number of inputs. Genetic algorithm is used to find a constructor that would be able to build arbitrarily large sorting network. The crucial part of the process is the so-called development inspired by biological ontogeny which means that the larger sorting network is created on the basis of its precursor according to the given rules. It is shown that these rules can be designed using genetic algorithm.<br>
dcterms:title
Evolutionary Constructor Design for the Sorting Networks Evolutionary Constructor Design for the Sorting Networks
skos:prefLabel
Evolutionary Constructor Design for the Sorting Networks Evolutionary Constructor Design for the Sorting Networks
skos:notation
RIV/00216305:26230/04:PU49220!RIV11-MSM-26230___
n3:aktivita
n8:V n8:Z n8:N
n3:aktivity
N, V, Z(MSM 262200012)
n3:dodaniDat
n7:2011
n3:domaciTvurceVysledku
n9:7463456
n3:druhVysledku
n13:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
563470
n3:idVysledku
RIV/00216305:26230/04:PU49220
n3:jazykVysledku
n17:eng
n3:klicovaSlova
evolutionarz design, genetic algorithm, sorting network, development<br>
n3:klicoveSlovo
n6:sorting%20network n6:genetic%20algorithm n6:development%3Cbr%3E n6:evolutionarz%20design
n3:kontrolniKodProRIV
[0F3C9AC28D58]
n3:mistoKonaniAkce
Brno
n3:mistoVydani
Brno
n3:nazevZdroje
Proceedings of 10th Conference and Competition Student EEICT 2004, Volume 1
n3:obor
n21:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n7:2004
n3:tvurceVysledku
Bidlo, Michal
n3:typAkce
n14:CST
n3:zahajeniAkce
2004-04-29+02:00
n3:zamer
n19:MSM%20262200012
s:numberOfPages
3
n11:hasPublisher
Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií
n15:isbn
80-214-2634-9
n16:organizacniJednotka
26230