This HTML5 document contains 41 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/
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/ontology/domain/vavai/
n15http://linked.opendata.cz/resource/domain/vavai/zamer/
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#
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F03%3A05030199%21RIV%2F2004%2FMSM%2FA05004%2FN/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F03%3A05030199%21RIV%2F2004%2FMSM%2FA05004%2FN
rdf:type
n10:Vysledek skos:Concept
dcterms:description
We consider the problem of preemptive scheduling on uniformly related machines.We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously...... We consider the problem of preemptive scheduling on uniformly related machines.We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4 competitive deterministic and 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously......
dcterms:title
Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171.
skos:prefLabel
Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171. Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171.
skos:notation
RIV/67985840:_____/03:05030199!RIV/2004/MSM/A05004/N
n3:aktivita
n4:P n4:Z
n3:aktivity
P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:dodaniDat
n6:2004
n3:domaciTvurceVysledku
n11:8679673
n3:druhVysledku
n16:V
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
619723
n3:idVysledku
RIV/67985840:_____/03:05030199
n3:jazykVysledku
n12:eng
n3:klicovaSlova
online scheduling; preemption; uniformly related machines
n3:klicoveSlovo
n8:preemption n8:online%20scheduling n8:uniformly%20related%20machines
n3:kontrolniKodProRIV
[F5404381F207]
n3:mistoVydani
Praha
n3:objednatelVyzkumneZpravy
Charles University
n3:obor
n13:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n7:ME%20476 n7:GA201%2F01%2F1195 n7:LN00A056
n3:rokUplatneniVysledku
n6:2003
n3:tvurceVysledku
Sgall, Jiří Ebenlendr, T.
n3:verzeVyzkumneZpravy
(1)
n3:zamer
n15:AV0Z1019905
s:numberOfPages
21