323 search results - page 60 / 65 » The Fault Tolerance of NP-Hard Problems |
114
Voted
CONEXT
2009
ACM
15 years 1 months ago
2009
ACM
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
125
click to vote
ISCA
2011
IEEE
14 years 4 months ago
2011
IEEE
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
100
click to vote
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
85
Voted
IPSN
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...
NGC
2000
Springer
15 years 3 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...