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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n13http://localhost/temp/predkladatel/
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F10%3A86081475%21RIV12-MSM-27240___/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F10%3A86081475%21RIV12-MSM-27240___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and it is also an appealing NP-complete problem. There is a number of heuristic and meta-heuristic algorithms that were tailored to deal with scheduling of independent jobs. In this paper we investigate the efficiency of differential evolution for the scheduling problem and compare it with existing approaches. The analysis shows that the differential evolution is a promising method that can compete with well-established scheduling algorithms. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and it is also an appealing NP-complete problem. There is a number of heuristic and meta-heuristic algorithms that were tailored to deal with scheduling of independent jobs. In this paper we investigate the efficiency of differential evolution for the scheduling problem and compare it with existing approaches. The analysis shows that the differential evolution is a promising method that can compete with well-established scheduling algorithms.
dcterms:title
Evolving Schedules of Independent Tasks by Differential Evolution Evolving Schedules of Independent Tasks by Differential Evolution
skos:prefLabel
Evolving Schedules of Independent Tasks by Differential Evolution Evolving Schedules of Independent Tasks by Differential Evolution
skos:notation
RIV/61989100:27240/10:86081475!RIV12-MSM-27240___
n4:aktivita
n17:Z
n4:aktivity
Z(MSM6198910027)
n4:dodaniDat
n7:2012
n4:domaciTvurceVysledku
Abraham Padath, Ajith n12:6026877 n12:4347269 n12:9175970
n4:druhVysledku
n8:C
n4:duvernostUdaju
n16:S
n4:entitaPredkladatele
n15:predkladatel
n4:idSjednocenehoVysledku
258063
n4:idVysledku
RIV/61989100:27240/10:86081475
n4:jazykVysledku
n10:eng
n4:klicovaSlova
HEURISTICS; ENVIRONMENT
n4:klicoveSlovo
n5:ENVIRONMENT n5:HEURISTICS
n4:kontrolniKodProRIV
[6F90A1862C68]
n4:mistoVydani
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
n4:nazevZdroje
INTELLIGENT NETWORKING, COLLABORATIVE SYSTEMS AND APPLICATIONS
n4:obor
n11:IN
n4:pocetDomacichTvurcuVysledku
4
n4:pocetStranKnihy
295
n4:pocetTvurcuVysledku
5
n4:rokUplatneniVysledku
n7:2010
n4:tvurceVysledku
Ezakian, H. Snášel, Václav Abraham Padath, Ajith Krömer, Pavel Platoš, Jan
n4:zamer
n18:MSM6198910027
s:numberOfPages
16
n14:hasPublisher
SPRINGER-VERLAG BERLIN
n20:isbn
978-3-642-16792-8
n13:organizacniJednotka
27240