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

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

Namespace Prefixes

PrefixIRI
n23http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n18http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/projekt/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/subjekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n10http://bibframe.org/vocab/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F11%3A86084968%21RIV13-GA0-27240___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F11%3A86084968%21RIV13-GA0-27240___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
Linear Ordering Problem (LOP) is a well know NP-hard problem combinatorial optimization problem attractive for its complexity, rich library of test data and variety of real world applications. In this paper, we use differential evolution accelerated by the GPU using the nVidia CUDA platform to find good LOP solutions. The well known LOLIB library was used to evaluate the efficiency and precision of the approach in solving LOP instances. Linear Ordering Problem (LOP) is a well know NP-hard problem combinatorial optimization problem attractive for its complexity, rich library of test data and variety of real world applications. In this paper, we use differential evolution accelerated by the GPU using the nVidia CUDA platform to find good LOP solutions. The well known LOLIB library was used to evaluate the efficiency and precision of the approach in solving LOP instances.
dcterms:title
Differential evolution for the linear ordering problem implemented on CUDA Differential evolution for the linear ordering problem implemented on CUDA
skos:prefLabel
Differential evolution for the linear ordering problem implemented on CUDA Differential evolution for the linear ordering problem implemented on CUDA
skos:notation
RIV/61989100:27240/11:86084968!RIV13-GA0-27240___
n7:predkladatel
n13:orjk%3A27240
n3:aktivita
n14:P
n3:aktivity
P(GA102/09/1494)
n3:dodaniDat
n11:2013
n3:domaciTvurceVysledku
n6:6026877 n6:4347269 n6:9175970
n3:druhVysledku
n22:D
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
194585
n3:idVysledku
RIV/61989100:27240/11:86084968
n3:jazykVysledku
n20:eng
n3:klicovaSlova
nVidia CUDA platform; linear ordering problem; differential evolution; combinatorial optimization problem; NP-hard problem; GPU
n3:klicoveSlovo
n4:differential%20evolution n4:linear%20ordering%20problem n4:GPU n4:nVidia%20CUDA%20platform n4:NP-hard%20problem n4:combinatorial%20optimization%20problem
n3:kontrolniKodProRIV
[F5F44DB6D47D]
n3:mistoKonaniAkce
New Orleans
n3:mistoVydani
New York
n3:nazevZdroje
2011 IEEE Congress of Evolutionary Computation, CEC 2011
n3:obor
n12:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n15:GA102%2F09%2F1494
n3:rokUplatneniVysledku
n11:2011
n3:tvurceVysledku
Krömer, Pavel Platoš, Jan Snášel, Václav
n3:typAkce
n23:WRD
n3:zahajeniAkce
2011-06-05+02:00
s:numberOfPages
7
n10:doi
10.1109/CEC.2011.5949700
n21:hasPublisher
IEEE
n17:isbn
978-1-4244-7834-7
n18:organizacniJednotka
27240