Zobrazeno 1 - 10
of 213
pro vyhledávání: '"Tixeuil, Sebastien"'
We present Elevator, a novel algorithm for hub samplingin peer-to-peer networks, enabling the construction of overlays with atopology between a random graph and a star network, and networksthat have both hubs and are resilient to failures. Our approa
Externí odkaz:
http://arxiv.org/abs/2406.07946
Traditional machine learning systems were designed in a centralized manner. In such designs, the central entity maintains both the machine learning model and the data used to adjust the model's parameters. As data centralization yields privacy issues
Externí odkaz:
http://arxiv.org/abs/2403.06583
We consider a collection of $k \geq 2$ robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called the \emph{Stand-Up Indulgent Gathering} (SUIG): given a collection of
Externí odkaz:
http://arxiv.org/abs/2402.14233
Autor:
Bramas, Quentin, Kakugawa, Hirotsugu, Kamei, Sayaka, Lamani, Anissa, Ooshita, Fukuhito, Shibata, Masahiro, Tixeuil, Sébastien
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights on line-shaped networks. In this problem, a group of mobile robots mus
Externí odkaz:
http://arxiv.org/abs/2312.12698
We investigate the solvability of the Byzantine Reliable Broadcast and Byzantine Broadcast Channel problems in distributed systems affected by Mobile Byzantine Faults. We show that both problems are not solvable even in one of the most constrained sy
Externí odkaz:
http://arxiv.org/abs/2311.05918
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected times until
Externí odkaz:
http://arxiv.org/abs/2305.11590
We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single location, which is not known in advance. If no robots crash, they must
Externí odkaz:
http://arxiv.org/abs/2304.05722
We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in finite tim
Externí odkaz:
http://arxiv.org/abs/2302.03466
Autor:
Okumura, Keisuke, Tixeuil, Sébastien
We study a novel graph path planning problem for multiple agents that may crash at runtime, and block part of the workspace. In our setting, agents can detect neighboring crashed agents, and change followed paths at runtime. The objective is then to
Externí odkaz:
http://arxiv.org/abs/2211.13908
We present QUANTAS: a simulator that enables quantitative performance analysis of distributed algorithms. It has a number of attractive features. QUANTAS is an abstract simulator, therefore, the obtained results are not affected by the specifics of a
Externí odkaz:
http://arxiv.org/abs/2205.04930