Sciweavers

257 search results - page 21 / 52
» Breaking Value Symmetry
Sort
View
AMAI
2005
Springer
13 years 7 months ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ICDCS
2009
IEEE
14 years 4 months ago
Fault-Tolerant Consensus in Unknown and Anonymous Networks
This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from cr...
Carole Delporte-Gallet, Hugues Fauconnier, Andreas...
FOCS
2006
IEEE
14 years 1 months ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
WDAG
2001
Springer
100views Algorithms» more  WDAG 2001»
14 years 1 days ago
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
Faith E. Fich, Colette Johnen