Sciweavers

3356 search results - page 19 / 672
» Determining Consensus Numbers
Sort
View
WDAG
2009
Springer
91views Algorithms» more  WDAG 2009»
14 years 2 months ago
Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
Henrique Moniz, Nuno Ferreira Neves, Miguel Correi...
SRDS
2000
IEEE
13 years 12 months ago
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
The concept of unreliable failure detector was introduced by Chandra and Toueg [2] as a mechanism that provides information about process failures. Depending on the properties the...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
13 years 7 months ago
Identifying Graph Automorphisms Using Determining Sets
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
Debra L. Boutin
EUROPAR
2007
Springer
14 years 1 months ago
Modeling and Validating the Performance of Atomic Broadcast Algorithms in High Latency Networks
Abstract. The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the ...
Richard Ekwall, André Schiper
ICCV
2009
IEEE
15 years 15 days ago
GroupSAC: Efficient Consensus in the Presence of Groupings
We present a novel variant of the RANSAC algorithm that is much more efficient, in particular when dealing with problems with low inlier ratios. Our algorithm assumes that there...
Kai Ni, Hailin Jin, Frank Dellaert