This HTML5 document contains 54 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n20http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n5http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985840%3A_____%2F04%3A00106816%21RIV%2F2005%2FMSM%2FA05005%2FN/
n9http://linked.opendata.cz/ontology/domain/vavai/
n15http://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#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985840%3A_____%2F04%3A00106816%21RIV%2F2005%2FMSM%2FA05005%2FN
rdf:type
n9: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 for unit-lenght 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 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 for unit-lenght 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 total weight of scheduled jobs. Článek studuje online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy.
dcterms:title
Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy Online competitive algorithms for maximizing weighted throughput of unit jobs Online competitive algorithms for maximizing weighted throughput of unit jobs
skos:prefLabel
Online competitive algorithms for maximizing weighted throughput of unit jobs Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy Online competitive algorithms for maximizing weighted throughput of unit jobs
skos:notation
RIV/67985840:_____/04:00106816!RIV/2005/MSM/A05005/N
n3:strany
187;198
n3:aktivita
n16:P n16:Z
n3:aktivity
P(GA201/01/1195), P(IAA1019401), P(LN00A056), P(ME 476), Z(AV0Z1019905)
n3:dodaniDat
n6:2005
n3:domaciTvurceVysledku
n5:7568037 n5:8679673
n3:druhVysledku
n10:D
n3:duvernostUdaju
n19:S
n3:entitaPredkladatele
n13:predkladatel
n3:idSjednocenehoVysledku
577979
n3:idVysledku
RIV/67985840:_____/04:00106816
n3:jazykVysledku
n8:eng
n3:klicovaSlova
online scheduling;unit jobs;deadlines
n3:klicoveSlovo
n11:deadlines n11:online%20scheduling n11:unit%20jobs
n3:kontrolniKodProRIV
[6FE730D207B1]
n3:mistoKonaniAkce
Montpellier
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)
n3:obor
n17:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
8
n3:projekt
n14:GA201%2F01%2F1195 n14:ME%20476 n14:LN00A056 n14:IAA1019401
n3:rokUplatneniVysledku
n6:2004
n3:tvurceVysledku
Chin, F. Y. L. Sgall, Jiří Chrobak, M. Bartal, Y. Jawor, W. Lavi, R. Tichý, Tomáš Fung, S. P. Y.
n3:typAkce
n20:WRD
n3:zahajeniAkce
2004-03-25+01:00
n3:zamer
n15:AV0Z1019905
s:numberOfPages
12
n12:hasPublisher
Springer-Verlag