Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Jiří Sgall"'
Publikováno v:
SIAM Journal on Computing. 51:1626-1691
Publikováno v:
Annals of Operations Research. 298:7-42
In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission t
Autor:
Marek Chrobak, Łukasz Jeż, Nguyen Kim Thang, Martin Böhm, Pavel Veselý, Jiří Sgall, Christoph Dürr, Jaroslaw Byrka, Marcin Bienkowski, Lukáš Folwarczný
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩
Theoretical Computer Science, Elsevier, 2021, 861, pp.133--143. ⟨10.1016/j.tcs.2021.02.016⟩
In the Multi-Level Aggregation Problem ( MLAP ), requests for service arrive at the nodes of an edge-weighted rooted tree T . Each service is represented by a subtree X of T that contains its root. This subtree X serves all requests that are pending
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0186c04d6bcce26ca5e147e16ac11595
https://hal.archives-ouvertes.fr/hal-03377715
https://hal.archives-ouvertes.fr/hal-03377715
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030927011
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec2aca3df9748afab9270a263f42aaa8
https://doi.org/10.1007/978-3-030-92702-8_14
https://doi.org/10.1007/978-3-030-92702-8_14
Autor:
Tim Süß, Peter Kling, Sören Riechers, André Brinkmann, Ernst Althaus, Friedhelm Meyer auf der Heide, Lars Nagel, Jiří Sgall
Publikováno v:
Journal of Scheduling. 21:77-92
We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement . The job can be processed at full speed if granted its full resource requirement
Publikováno v:
Journal of Combinatorial Optimization. 34:810-828
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the
Publikováno v:
Algorithmica. 80:155-184
In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to be packed into bins of unit capacity. Each item has one of at least two colors and an additional constraint is that we cannot pack two items of the same color next to
Publikováno v:
Scopus-Elsevier
In the online packet scheduling problem with deadlines (PacketSchD, for short), the goal is to schedule transmissions of packets that arrive over time in a network switch and need to be sent across a link. Each packet has a deadline, representing its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::feb9cfb7262728ca95e162dcbc507f3d
Publikováno v:
Approximation and Online Algorithms ISBN: 9783319894409
WAOA
WAOA
In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c45e718a7e6262ef10356acfbd96229
https://doi.org/10.1007/978-3-319-89441-6_15
https://doi.org/10.1007/978-3-319-89441-6_15
Autor:
Mohammad Reza Mousavi, Jiří Sgall
This book constitutes the refereed proceedings of the Second IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2017, held in Tehran, Iran, in September 2017. The 8 papers presented in this volume were carefully revi