Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Klaus-Tycho Foerster"'
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures.
Publikováno v:
ACM Transactions on Modeling and Performance Evaluation of Computing Systems.
Emerging reconfigurable data centers introduce unprecedented flexibility in how the physical layer can be programmed to adapt to current traffic demands. These reconfigurable topologies are commonly hybrid, consisting of static and reconfigurable lin
Autor:
Klaus-Tycho Foerster, Thibault Marette, Stefan Neumann, Claudia Plant, Ylli Sadikaj, Stefan Schmid, Yllka Velaj
Publikováno v:
Proceedings of the ACM Web Conference 2023.
Publikováno v:
2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Jun 2022, Baltimore, United States. pp.215-226, ⟨10.1109/dsn53405.2022.00032⟩
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Jun 2022, Baltimore, United States. pp.215-226, ⟨10.1109/dsn53405.2022.00032⟩
Modern communication networks feature fully decentralized flow rerouting mechanisms which allow them to quickly react to link failures. This paper revisits the fundamental algorithmic problem underlying such local fast rerouting mechanisms. Is it pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04fc188563a51ba8d4fd38471c61f15b
http://arxiv.org/abs/2204.03413
http://arxiv.org/abs/2204.03413
Publikováno v:
Theoretical Computer Science. 839:176-185
We study the problem of online graph exploration on undirected graphs, where a searcher has to visit every vertex and return to the origin. Once a new vertex is visited, the searcher learns of all neighboring vertices and the connecting edge weights.
Publikováno v:
IEEE Transactions on Vehicular Technology. 69:12252-12263
Aerial Base Stations (ABSs) promise resilient and perpetual connectivity after unexpected events such as natural disasters. However, the deployment and scheduling of ABSs introduce several algorithmic challenges. In particular, on-demand communicatio
Publikováno v:
IEEE Network. 34:240-246
Many modern Internet services and applications operate on top of geographically distributed datacenters, which replicate large volumes of business data and other content, to improve performance and reliability. This leads to high volumes of continuou
Publikováno v:
Theoretical Computer Science. 811:56-69
We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point s, not necessarily on the junction j of the m rays, move at unit speed, and can communicate wirelessly. The goal is
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030948993
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b100bcc70c462d33fa69489e4063aa4
https://doi.org/10.1007/978-3-030-94900-6_1
https://doi.org/10.1007/978-3-030-94900-6_1
Publikováno v:
Proceedings of the Symposium on Architectures for Networking and Communications Systems.