Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Łukasz Jeż"'
Publikováno v:
SIAM Journal on Computing. 51:1626-1691
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::262b709e89f24e22ab1fe2528ea63c52
https://doi.org/10.1007/978-3-031-06678-8_8
https://doi.org/10.1007/978-3-031-06678-8_8
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:
STOC
We study the resource augmented version of the $k$-server problem, also known as the $k$-server problem against weak adversaries or the $(h,k)$-server problem. In this setting, an online algorithm using $k$ servers is compared to an offline algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::acefa21c6eccd762fefd3baefb609046
https://ir.cwi.nl/pub/30210
https://ir.cwi.nl/pub/30210
Publikováno v:
Journal of Scheduling. 20:623-634
We consider scheduling information units called frames, each with a delivery deadline. Frames consist of packets, which arrive online in a roughly periodic fashion, and compete on allocation of transmission slots. A frame is deemed useful only if all
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:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩
Discrete Applied Mathematics, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩
Discrete Applied Mathematics, Elsevier, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩
Discrete Applied Mathematics, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩
International audience; Since a few years there is an increasing interest in minimizing the energy consumption of computing systems. However in a shared computing system, users want to optimize their experienced quality of service, at the price of a
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
Publikováno v:
Advances in Sciences and Technology, Vol 17, Iss 1, Pp 243-251 (2023)
The method does not differ in difficulty from the standard surface temperature imaging method, which is its unquestionable advantage. The disadvantage is the need to use test models made of materials transmitting visible light in the full range (blue
Externí odkaz:
https://doaj.org/article/80565587d80c4419915526660dddc2bb