264 search results - page 27 / 53 » Bounding the number of tolerable faults in majority-based sy... |
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
ICDCS
2000
IEEE
15 years 1 months ago
2000
IEEE
To assure dependable onboard evolution, we have developed a methodology called guarded software upgrading (GSU). In this paper, we focus on a low-cost approach to error containmen...
74
Voted
PDCAT
2005
Springer
15 years 2 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
ICISC
2008
14 years 11 months ago
2008
Relay attacks are one of the most challenging threats RFID will have to face in the close future. They consist in making the verifier believe that the prover is in its close vicini...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...