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

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F02%3A05030203%21RIV%2F2004%2FMSM%2FA05004%2FN
rdf:type
n18:Vysledek skos:Concept
dcterms:description
This paper studies randomized on-line non-preemptive scheduling in multiprocessor systems. In this problem each task is specified by its processing time andscheduled on any of $m$ identical processors. The objective is to minimize theexpected mekespan. We prove lemmas and theorems describing $sigma_m$-competitive randomized algorithms on $m$ processors. The main result is an........ This paper studies randomized on-line non-preemptive scheduling in multiprocessor systems. In this problem each task is specified by its processing time andscheduled on any of $m$ identical processors. The objective is to minimize theexpected mekespan. We prove lemmas and theorems describing $sigma_m$-competitive randomized algorithms on $m$ processors. The main result is an........
dcterms:title
Multiprocessor Randomized On-line Scheduling. Multiprocessor Randomized On-line Scheduling.
skos:prefLabel
Multiprocessor Randomized On-line Scheduling. Multiprocessor Randomized On-line Scheduling.
skos:notation
RIV/67985840:_____/02:05030203!RIV/2004/MSM/A05004/N
n3:aktivita
n17:Z n17:P
n3:aktivity
P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:dodaniDat
n12:2004
n3:domaciTvurceVysledku
n14:7568037
n3:druhVysledku
n6:V
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n8:predkladatel
n3:idSjednocenehoVysledku
654644
n3:idVysledku
RIV/67985840:_____/02:05030203
n3:jazykVysledku
n4:eng
n3:klicovaSlova
online; randomized; scheduling
n3:klicoveSlovo
n9:scheduling n9:online n9:randomized
n3:kontrolniKodProRIV
[94151B7D54F1]
n3:mistoVydani
Praha
n3:objednatelVyzkumneZpravy
Institute for Theoretical Computer Science, Charles University
n3:obor
n11:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n15:LN00A056 n15:GA201%2F01%2F1195 n15:ME%20476
n3:rokUplatneniVysledku
n12:2002
n3:tvurceVysledku
Tichý, Tomáš
n3:verzeVyzkumneZpravy
(1)
n3:zamer
n10:AV0Z1019905
s:numberOfPages
10