Sciweavers

323 search results - page 34 / 65
» The Fault Tolerance of NP-Hard Problems
Sort
View
ICPADS
2006
IEEE
16 years 5 days ago
Fast Convergence in Self-Stabilizing Wireless Networks
The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed system, motivating designs that autonomously recover from tra...
Nathalie Mitton, Eric Fleury, Isabelle Guér...
ICDCS
2011
IEEE
14 years 5 months ago
Smart Redundancy for Distributed Computation
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
Yuriy Brun, George Edwards, Jae Young Bang, Nenad ...
SAFECOMP
2005
Springer
15 years 11 months ago
Safety Interfaces for Component-Based Systems
Abstract. This paper addresses the problems appearing in componentbased development of safety-critical systems. We aim at efficient reasoning about safety at system level while add...
Jonas Elmqvist, Simin Nadjm-Tehrani, Marius Minea
FOCS
1993
IEEE
15 years 10 months ago
A Tight Lower Bound for k-Set Agreement
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
Soma Chaudhuri, Maurice Herlihy, Nancy A. Lynch, M...
WDAG
2007
Springer
73views Algorithms» more  WDAG 2007»
16 years 7 days ago
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
Consider a distributed network of n nodes that is connected to a global source of “beats”. All nodes receive the “beats” simultaneously, and operate in lock-step. A scheme ...
Danny Dolev, Ezra N. Hoch