Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Jasmin Smula"'
Publikováno v:
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications ISBN: 9783319125671
Adventures Between Lower Bounds and Higher Altitudes
Adventures Between Lower Bounds and Higher Altitudes
We modify one of the foundational online problems, Disjoint Path Allocation, to include weighted requests. We provide a comprehensive competitive analysis, incorporating the viewpoints of both advice complexity and parametrized complexity. Our bounds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2222171894d596a137e861ee69b06dd
https://doi.org/10.1007/978-3-319-98355-4_14
https://doi.org/10.1007/978-3-319-98355-4_14
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783319252575
SIROCCO
SIROCCO
The node searching problem a.k.a. treasure hunt is a fundamental task performed by mobile agents in a network and can be viewed as an online version of the shortest path problem: an agent starts in a vertex of an unknown weighted undirected graph, an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::173c12f744c1e52e0d8ca1cf69c0724c
https://doi.org/10.1007/978-3-319-25258-2_23
https://doi.org/10.1007/978-3-319-25258-2_23
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319213972
COCOON
COCOON
We study the disjoint path allocation problem. In this setting, a path \(P\) of length \(L\) is given, and a sequence of subpaths of \(P\) arrives online, one in every time step. Each such path requests a permanent connection between its two end-vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6104ee854cc78bd0e64b0f4d4d47a49
https://doi.org/10.1007/978-3-319-21398-9_33
https://doi.org/10.1007/978-3-319-21398-9_33
Autor:
Sacha Krug, Dennis Komm, Juraj Hromkovič, Jasmin Smula, Andreas Sprock, Hans-Joachim Böckenhauer
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642387678
COCOON
COCOON
The advice complexity of an online problem describes the additional information both necessary and sufficient for online algorithms to compute solutions of a certain quality. In this model, an oracle inspects the input before it is processed by an on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01c7c7425abe28e8c9dec0ff79b2f0e0
https://doi.org/10.1007/978-3-642-38768-5_44
https://doi.org/10.1007/978-3-642-38768-5_44
Publikováno v:
FOMC
This paper presents an efficient algorithm for detecting and disseminating information in a single-hop multi-channel network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c760d4f61fba0c38c3840922dc3b4d1b
https://doi.org/10.1145/1998476.1998487
https://doi.org/10.1145/1998476.1998487
Publikováno v:
PODC
This article presents an algorithm for detecting and disseminating information in a single-hop multi-channel wireless network: k arbitrary nodes have information they want to share with the entire network. Neither the nodes that have information nor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b78d9b69518bac89cd2b450d4eee73a2
https://doi.org/10.1145/1993806.1993842
https://doi.org/10.1145/1993806.1993842
Publikováno v:
PODC
Wireless networks often experience a significant amount of churn, the arrival and departure of nodes. We propose a distributed algorithm that detects churn and is resilient to a worst-case adversary. The nodes of the network are notified about change
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc653c695d41e56b95df9713d0df5964
https://doi.org/10.1145/1835698.1835734
https://doi.org/10.1145/1835698.1835734
Publikováno v:
Theoretical Computer Science. :29-43
Wireless networks often experience a significant amount of churn, i.e. the arrival and departure of nodes, and often it is necessary to keep all nodes informed about all other nodes in the network. In this paper, we propose a distributed algorithm fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a217940352d3b7d0368b7cd79f2587fa