Sciweavers

SIROCCO
2010
13 years 10 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
SIROCCO
2010
14 years 1 months ago
Multipath Spanners
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
Cyril Gavoille, Quentin Godfroy, Laurent Viennot
SIROCCO
2010
14 years 1 months ago
Algorithms for Extracting Timeliness Graphs
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
Carole Delporte-Gallet, Stéphane Devismes, ...
SIROCCO
2010
14 years 1 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
SIROCCO
2010
14 years 1 months ago
Average Long-Lived Memoryless Consensus: The Three-Value Case
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Ivan Rapaport, Eric Rémila
SIROCCO
2010
14 years 1 months ago
Towards Network Games with Social Preferences
Many distributed systems can be modeled as network games: a collection of selfish players that communicate in order to maximize their individual utilities. The performance of such ...
Petr Kuznetsov, Stefan Schmid
SIROCCO
2010
14 years 1 months ago
On the Impact of Local Taxes in a Set Cover Game
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
Bruno Escoffier, Laurent Gourvès, Jé...
SIROCCO
2010
14 years 1 months ago
Event Extent Estimation
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
Marcin Bienkowski, Leszek Gasieniec, Marek Klonows...
SIROCCO
2010
14 years 1 months ago
Asynchronous Deterministic Rendezvous in Bounded Terrains
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...