Zobrazeno 1 - 10
of 187
pro vyhledávání: '"Devismes, Stéphane"'
A mobile agent, starting from a node $s$ of a simple undirected connected graph $G=(V,E)$, has to explore all nodes and edges of $G$ using the minimum number of edge traversals. To do so, the agent uses a deterministic algorithm that allows it to gai
Externí odkaz:
http://arxiv.org/abs/2410.13386
We present a self-stabilizing algorithm for the (asynchronous) unison problem which achieves an efficient trade-off between time, workload, and space in a weak model. Precisely, our algorithm is defined in the atomic-state model and works in anonymou
Externí odkaz:
http://arxiv.org/abs/2307.16593
This paper deals with the trade-off between time, workload, and versatility in self-stabilization, a general and lightweight fault-tolerant concept in distributed computing.In this context, we propose a transformer that provides an asynchronous silen
Externí odkaz:
http://arxiv.org/abs/2307.06635
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
Publikováno v:
In Theoretical Computer Science 25 October 2023 977
We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorithm proposed by Colette Johnen in 1997. This algorithm constructs a BFS
Externí odkaz:
http://arxiv.org/abs/1907.07944
Publikováno v:
In Theoretical Computer Science 10 July 2023 964
We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycles. They all agree on a common chirality, but have no global compass. F
Externí odkaz:
http://arxiv.org/abs/1905.09271