This HTML5 document contains 47 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/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/ontology/domain/vavai/
n18http://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#
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F07%3A00096123%21RIV08-AV0-67985840/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F07%3A00096123%21RIV08-AV0-67985840
rdf:type
n9:Vysledek skos:Concept
dcterms:description
Článek studuje online rozvrhování stejně dlouhých úloh s restarty a použitím pravděpodobnostních algoritmů. We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios below $2$ and show several lower bounds on the competitive ratios. We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios below $2$ and show several lower bounds on the competitive ratios.
dcterms:title
Online rozvrhování úloh stejné délky: Náhodnost a restarty pomáhají Online scheduling of equal-length jobs: Randomization and restarts help Online scheduling of equal-length jobs: Randomization and restarts help
skos:prefLabel
Online rozvrhování úloh stejné délky: Náhodnost a restarty pomáhají Online scheduling of equal-length jobs: Randomization and restarts help Online scheduling of equal-length jobs: Randomization and restarts help
skos:notation
RIV/67985840:_____/07:00096123!RIV08-AV0-67985840
n3:strany
1709;1728
n3:aktivita
n16:P n16:Z
n3:aktivity
P(1M0545), P(GA201/05/0124), P(IAA1019401), Z(AV0Z10190503)
n3:cisloPeriodika
6
n3:dodaniDat
n7:2008
n3:domaciTvurceVysledku
n4:7568037 n4:8679673
n3:druhVysledku
n14:J
n3:duvernostUdaju
n17:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
439529
n3:idVysledku
RIV/67985840:_____/07:00096123
n3:jazykVysledku
n15:eng
n3:klicovaSlova
online algorithms; scheduling
n3:klicoveSlovo
n11:online%20algorithms n11:scheduling
n3:kodStatuVydavatele
US - Spojené státy americké
n3:kontrolniKodProRIV
[5F1B5BF12621]
n3:nazevZdroje
Siam Journal on Computing
n3:obor
n8:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
4
n3:projekt
n10:1M0545 n10:IAA1019401 n10:GA201%2F05%2F0124
n3:rokUplatneniVysledku
n7:2007
n3:svazekPeriodika
36
n3:tvurceVysledku
Tichý, Tomáš Chrobák, M. Sgall, Jiří Jawor, W.
n3:zamer
n18:AV0Z10190503
s:issn
0097-5397
s:numberOfPages
20