Sciweavers

264 search results - page 38 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
MOBICOM
2004
ACM
15 years 2 months ago
FLSS: a fault-tolerant topology control algorithm for wireless networks
Topology control algorithms usually reduce the number of links in a wireless network, which in turn decreases the degree of connectivity. The resulting network topology is more su...
Ning Li, Jennifer C. Hou
SPAA
2010
ACM
15 years 2 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
SAC
2006
ACM
15 years 3 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
Sylvie Boldo, César Muñoz
ASIACRYPT
2000
Springer
15 years 1 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
MASCOTS
1993
14 years 10 months ago
Simulation Modeling of Weak-Consistency Protocols
: Weak-consistency replication protocols can be used to build wide-area services that are scalable, fault-tolerant, and useful for mobile computer systems. We have evaluated the ti...
Richard A. Golding, Darrell D. E. Long