Sciweavers

1845 search results - page 194 / 369
» Computing the Angularity Tolerance
Sort
View
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
16 years 18 days ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
ICNC
2005
Springer
16 years 13 hour ago
On Designing DNA Databases for the Storage and Retrieval of Digital Signals
Abstract. In this paper we propose a procedure for the storage and retrieval of digital signals utilizing DNA. Digital signals are encoded in DNA sequences that satisfy among other...
Sotirios A. Tsaftaris, Aggelos K. Katsaggelos
ICTAC
2005
Springer
16 years 12 hour ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
ISPA
2004
Springer
15 years 12 months ago
Highly Reliable Linux HPC Clusters: Self-Awareness Approach
Abstract. Current solutions for fault-tolerance in HPC systems focus on dealing with the result of a failure. However, most are unable to handle runtime system configuration change...
Chokchai Leangsuksun, Tong Liu, Yudan Liu, Stephen...
ISORC
2003
IEEE
15 years 11 months ago
A Dynamic Shadow Approach for Mobile Agents to Survive Crash Failures
Fault tolerance schemes for mobile agents to survive agent server crash failures are complex since developers normally have no control over remote agent servers. Some solutions mo...
Simon Pears, Jie Xu, Cornelia Boldyreff