1845 search results - page 169 / 369 » Computing the Angularity Tolerance |
125
Voted
JPDC
2008
15 years 3 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
156
Voted
SOSP
2007
ACM
16 years 17 days ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
151
Voted
MOBISYS
2008
ACM
16 years 3 months ago
2008
ACM
Many people desire ubiquitous access to their personal computing environments. We present a system in which a user leverages a personal mobile device to establish trust in a publi...
128
Voted
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
We present a web computing library (PUBWCL) in Java that allows to execute tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style on PCs distributed ove...
115
Voted
RANDOM
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...