About: Online competitive algorithms for maximizing weighted throughput of unit jobs     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
  • Článek studuje online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy. (cs)
Title
  • Online competitive algorithms for maximizing weighted throughput of unit jobs
  • Online competitive algorithms for maximizing weighted throughput of unit jobs (en)
  • Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy (cs)
skos:prefLabel
  • Online competitive algorithms for maximizing weighted throughput of unit jobs
  • Online competitive algorithms for maximizing weighted throughput of unit jobs (en)
  • Online kompetitivní algoritmy pro maximalizaci vážené propustnosti pro jednotkové úlohy (cs)
skos:notation
  • RIV/67985840:_____/04:00106816!RIV/2005/MSM/A05005/N
http://linked.open.../vavai/riv/strany
  • 187;198
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/01/1195), P(IAA1019401), P(LN00A056), P(ME 476), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 577979
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/04:00106816
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • online scheduling;unit jobs;deadlines (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [6FE730D207B1]
http://linked.open...v/mistoKonaniAkce
  • Montpellier
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Chrobak, M.
  • Sgall, Jiří
  • Tichý, Tomáš
  • Jawor, W.
  • Bartal, Y.
  • Chin, F. Y. L.
  • Fung, S. P. Y.
  • Lavi, R.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software