This HTML5 document contains 44 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/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/ontology/domain/vavai/
n4http://linked.opendata.cz/resource/domain/vavai/zamer/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F04%3A00106818%21RIV%2F2005%2FMSM%2FA05005%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#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F04%3A00106818%21RIV%2F2005%2FMSM%2FA05005%2FN
rdf:type
n16:Vysledek skos:Concept
dcterms:description
We consider a randomized on-line scheduling problem where each job has to be scheduled on any of $m$ identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for $m=3$ processors must be strictly greater than $27/19$. We consider a randomized on-line scheduling problem where each job has to be scheduled on any of $m$ identical processors. The objective is to minimize the expected makespan. We show that the competitive ratio of any randomized algorithm for $m=3$ processors must be strictly greater than $27/19$. Článek studuje pravděpodobnostní rozvrhování na 3 počítačích.
dcterms:title
Randomized On-line Scheduling on 3 processors Pravděpodobnostní rozvrhování na 3 počítačích Randomized On-line Scheduling on 3 processors
skos:prefLabel
Randomized On-line Scheduling on 3 processors Randomized On-line Scheduling on 3 processors Pravděpodobnostní rozvrhování na 3 počítačích
skos:notation
RIV/67985840:_____/04:00106818!RIV/2005/MSM/A05005/N
n3:strany
152;158
n3:aktivita
n11:P n11:Z
n3:aktivity
P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:cisloPeriodika
2
n3:dodaniDat
n7:2005
n3:domaciTvurceVysledku
n14:7568037
n3:druhVysledku
n12:J
n3:duvernostUdaju
n15:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
583538
n3:idVysledku
RIV/67985840:_____/04:00106818
n3:jazykVysledku
n9:eng
n3:klicovaSlova
scheduling;makespan;competitive analysis
n3:klicoveSlovo
n13:scheduling n13:makespan n13:competitive%20analysis
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[E7EB941D2E5F]
n3:nazevZdroje
Operation Research Letters
n3:obor
n17:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n6:LN00A056 n6:ME%20476 n6:GA201%2F01%2F1195
n3:rokUplatneniVysledku
n7:2004
n3:svazekPeriodika
32
n3:tvurceVysledku
Tichý, Tomáš
n3:zamer
n4:AV0Z1019905
s:issn
0167-6377
s:numberOfPages
7