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

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F03%3A05030084%21RIV%2F2004%2FMSM%2FA05004%2FN
rdf:type
skos:Concept n15:Vysledek
dcterms:description
We are given a set of tasks with release times, deadlines, and profit rates. In the metered model, a task brings profit proportional to the execution time even if not completed. We present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms. We are given a set of tasks with release times, deadlines, and profit rates. In the metered model, a task brings profit proportional to the execution time even if not completed. We present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms.
dcterms:title
Preemptive scheduling in overloaded systems. Preemptive scheduling in overloaded systems.
skos:prefLabel
Preemptive scheduling in overloaded systems. Preemptive scheduling in overloaded systems.
skos:notation
RIV/67985840:_____/03:05030084!RIV/2004/MSM/A05004/N
n3:strany
183;197
n3:aktivita
n6:P n6:Z
n3:aktivity
P(GA201/01/1195), P(IAA1019901), P(LN00A056), P(ME 476), Z(AV0Z1019905), Z(MSM 113200005)
n3:cisloPeriodika
1
n3:dodaniDat
n13:2004
n3:domaciTvurceVysledku
n14:7568037 n14:8679673
n3:druhVysledku
n18:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
622587
n3:idVysledku
RIV/67985840:_____/03:05030084
n3:jazykVysledku
n9:eng
n3:klicovaSlova
scheduling; online algorithms; benefit
n3:klicoveSlovo
n7:benefit n7:scheduling n7:online%20algorithms
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[55D2297A79D4]
n3:nazevZdroje
Journal of Computer and System Sciences
n3:obor
n16:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
7
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n10:IAA1019901 n10:LN00A056 n10:ME%20476 n10:GA201%2F01%2F1195
n3:rokUplatneniVysledku
n13:2003
n3:svazekPeriodika
67
n3:tvurceVysledku
Chrobak, M. Noga, J. Vakhania, N. van Stee, R. Sgall, Jiří Epstein, L. Tichý, Tomáš
n3:zamer
n8:MSM%20113200005 n8:AV0Z1019905
s:issn
0022-0000
s:numberOfPages
15