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

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

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F04%3A00106815%21RIV10-MSM-67985840/
n12https://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#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F04%3A00106815%21RIV10-MSM-67985840
rdf:type
n11: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. 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.
dcterms:title
Optimal and online preemptive scheduling on uniformly related machines Optimal and online preemptive scheduling on uniformly related machines
skos:prefLabel
Optimal and online preemptive scheduling on uniformly related machines Optimal and online preemptive scheduling on uniformly related machines
skos:notation
RIV/67985840:_____/04:00106815!RIV10-MSM-67985840
n3:aktivita
n5:Z n5:P
n3:aktivity
P(GA201/01/1195), P(IAA1019401), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:dodaniDat
n8:2010
n3:domaciTvurceVysledku
n18:8679673
n3:druhVysledku
n13:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
578155
n3:idVysledku
RIV/67985840:_____/04:00106815
n3:jazykVysledku
n10:eng
n3:klicovaSlova
online scheduling; preemption; uniformly related machines
n3:klicoveSlovo
n4:online%20scheduling n4:preemption n4:uniformly%20related%20machines
n3:kontrolniKodProRIV
[9A3C0432BF51]
n3:mistoKonaniAkce
Montpellier
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)
n3:obor
n17:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n7:IAA1019401 n7:GA201%2F01%2F1195 n7:LN00A056 n7:ME%20476
n3:rokUplatneniVysledku
n8:2004
n3:tvurceVysledku
Sgall, Jiří Ebenlendr, T.
n3:typAkce
n9:WRD
n3:wos
000189497100018
n3:zahajeniAkce
2004-03-25+01:00
n3:zamer
n19:AV0Z1019905
s:numberOfPages
12
n15:hasPublisher
Springer-Verlag
n12:isbn
3-540-21236-1