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
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F03%3A05030142%21RIV%2F2004%2FMSM%2FA05004%2FN/
dctermshttp://purl.org/dc/terms/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/resource/domain/vavai/projekt/
n3http://linked.opendata.cz/ontology/domain/vavai/
n11http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F03%3A05030142%21RIV%2F2004%2FMSM%2FA05004%2FN
rdf:type
n3:Vysledek skos:Concept
dcterms:description
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs. We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs.
dcterms:title
Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172. Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172.
skos:prefLabel
Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172. Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172.
skos:notation
RIV/67985840:_____/03:05030142!RIV/2004/MSM/A05004/N
n4:aktivita
n18:Z n18:P
n4:aktivity
P(GA201/01/1195), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n4:dodaniDat
n10:2004
n4:domaciTvurceVysledku
n15:8679673 n15:7568037
n4:druhVysledku
n7:V
n4:duvernostUdaju
n17:S
n4:entitaPredkladatele
n16:predkladatel
n4:idSjednocenehoVysledku
619560
n4:idVysledku
RIV/67985840:_____/03:05030142
n4:jazykVysledku
n6:eng
n4:klicovaSlova
scheduling problem; quality-of-service applications
n4:klicoveSlovo
n14:scheduling%20problem n14:quality-of-service%20applications
n4:kontrolniKodProRIV
[E3B4ABC43AB5]
n4:mistoVydani
Praha
n4:objednatelVyzkumneZpravy
Charles University
n4:obor
n13:BA
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
8
n4:pocetUcastnikuAkce
0
n4:pocetZahranicnichUcastnikuAkce
0
n4:projekt
n5:GA201%2F01%2F1195 n5:LN00A056 n5:ME%20476
n4:rokUplatneniVysledku
n10:2003
n4:tvurceVysledku
Fung, S. P. Y. Sgall, Jiří Jawor, W. Chin, F. Y. L. Bartal, Y. Lavi, R. Tichý, Tomáš Chrobak, M.
n4:verzeVyzkumneZpravy
(1)
n4:zamer
n11:AV0Z1019905
s:numberOfPages
25