"Montpellier" . "Chin, F. Y. L." . "Online competitive algorithms for maximizing weighted throughput of unit jobs"@en . . . "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 . . "2"^^ . . "Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS)" . . "Sgall, Ji\u0159\u00ED" . "RIV/67985840:_____/04:00106816" . . "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." . "Online kompetitivn\u00ED algoritmy pro maximalizaci v\u00E1\u017Een\u00E9 propustnosti pro jednotkov\u00E9 \u00FAlohy"@cs . "Springer-Verlag" . "online scheduling;unit jobs;deadlines"@en . . "Chrobak, M." . "Online competitive algorithms for maximizing weighted throughput of unit jobs" . "RIV/67985840:_____/04:00106816!RIV/2005/MSM/A05005/N" . "Bartal, Y." . . . "Online kompetitivn\u00ED algoritmy pro maximalizaci v\u00E1\u017Een\u00E9 propustnosti pro jednotkov\u00E9 \u00FAlohy"@cs . . "2004-03-25+01:00"^^ . . . . "Jawor, W." . "Lavi, R." . . "187;198" . . "Tich\u00FD, Tom\u00E1\u0161" . "12"^^ . "[6FE730D207B1]" . . "Online competitive algorithms for maximizing weighted throughput of unit jobs"@en . "577979" . . . "\u010Cl\u00E1nek studuje online kompetitivn\u00ED algoritmy pro maximalizaci v\u00E1\u017Een\u00E9 propustnosti pro jednotkov\u00E9 \u00FAlohy."@cs . "Berlin" . "8"^^ . . "Fung, S. P. Y." . . . . "P(GA201/01/1195), P(IAA1019401), P(LN00A056), P(ME 476), Z(AV0Z1019905)" . "Online competitive algorithms for maximizing weighted throughput of unit jobs" .