Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Tixeuil, S��bastien"'
Autor:
Heriban, Adam, Tixeuil, S��bastien
The vast majority of existing Distributed Computing literature about mobile robotic swarms considers computability issues: characterizing the set of system hypotheses that enables problem solvability. By contrast, the focus of this work is to investi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c21fd29c247aa5e30642719100c30552
http://arxiv.org/abs/2105.09667
http://arxiv.org/abs/2105.09667
Publikováno v:
24th International Conference on Principles of Distributed Systems (OPODIS 2020)
24th International Conference on Principles of Distributed Systems (OPODIS 2020), Dec 2020, Strasbourg, France. pp.33:1--33:16, ⟨10.4230/LIPIcs.OPODIS.2020.33⟩
24th International Conference on Principles of Distributed Systems (OPODIS 2020), Dec 2020, Strasbourg, France. pp.33:1--33:16, ⟨10.4230/LIPIcs.OPODIS.2020.33⟩
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of arbitrary communication grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50f13d8b0f021c08661830920a6c9fb9
https://hal.sorbonne-universite.fr/hal-03013644
https://hal.sorbonne-universite.fr/hal-03013644
Autor:
L��chine, Ulysse, Tixeuil, S��bastien
In this paper, we consider the problem of scattering a swarm of mobile oblivious robots in a continuous space. We consider the fully asynchronous setting where robots may base their computation on past observations, or may be observed by other robots
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87fa9dc6347a1df55dca44350249135d
http://arxiv.org/abs/1905.09177
http://arxiv.org/abs/1905.09177
In this paper we prove lower and matching upper bounds for the number of servers required to implement a regular shared register that tolerates unsynchronized Mobile Byzantine failures. We consider the strongest model of Mobile Byzantine failures to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99831c5b49440618f83563f08eb53f02
http://arxiv.org/abs/1707.05063
http://arxiv.org/abs/1707.05063
Autor:
Blin, L��lia, Tixeuil, S��bastien
We present a self-stabilizing leader election algorithm for arbitrary networks, with space-complexity $O(\max\{\log ��, \log \log n\})$ bits per node in $n$-node networks with maximum degree~$��$. This space complexity is sub-logarithmic in $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abd37121947b4f637f40d13e45a90a7a
We study unlimited infinite churn in peer-to-peer overlay networks. Under this churn, arbitrary many peers may concurrently request to join or leave the overlay network; moreover these requests may never stop coming. We prove that unlimited adversari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e641f1653f9eec9243e829ec97e6858
http://arxiv.org/abs/1608.00726
http://arxiv.org/abs/1608.00726
We present two stateless algorithms that guarantee to deliver the message to every device in a designated geographic area: flooding and planar geocasting. Due to the algorithms' statelessness, intermediate devices do not have to keep message data bet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::694f78613512d3665bca5c4b0d4264c8
http://arxiv.org/abs/1506.07895
http://arxiv.org/abs/1506.07895
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative
Autor:
Blin, L��lia, Tixeuil, S��bastien
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be \emph{silent} (i.e., when communication content remains fixed from some point in time during any execution), t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bd77e322ba9fe4f795999d5a5713629
The problem of gathering multiple mobile robots to a single location, is one of the fundamental problems in distributed coordination between autonomous robots. The problem has been studied and solved even for robots that are anonymous, disoriented, m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0158c2de8e4e0e377fb5fe510ca18bb7
http://arxiv.org/abs/1207.0226
http://arxiv.org/abs/1207.0226
Autor:
Dubois, Swan, Tixeuil, S��bastien
We survey existing scheduling hypotheses made in the literature in self-stabilization, commonly referred to under the notion of daemon. We show that four main characteristics (distribution, fairness, boundedness, and enabledness) are enough to encaps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c0be27cbda887a42c2727646301e005
http://arxiv.org/abs/1110.0334
http://arxiv.org/abs/1110.0334