323 search results - page 26 / 65 » The Fault Tolerance of NP-Hard Problems |
131
click to vote
DSN
2006
IEEE
16 years 2 days ago
2006
IEEE
As chip densities and clock rates increase, processors are becoming more susceptible to transient faults that can affect program correctness. Computer architects have typically ad...
191
click to vote
MOBIHOC
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
161
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
155
click to vote
JPDC
2008
15 years 6 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...
161
click to vote
ISPAN
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose the coordinated robust routing (CRR) scheme to address the fault tolerance requirements in the layered wireless sensor networks. In the proposed scheme, ...