264 search results - page 13 / 53 » Bounding the number of tolerable faults in majority-based sy... |
FOCS
1993
IEEE
15 years 1 months ago
1993
IEEE
: 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...
SPAA
2000
ACM
15 years 1 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we consider a distributed system that consists of a group of teams of worker robots that rely on physical robot messengers for the communication between the teams. ...
DFT
2000
IEEE
15 years 1 months ago
2000
IEEE
1 Over the last years, an increasing number of safety-critical tasks have been demanded to computer systems. In particular, safety-critical computer-based applications are hitting ...
DOA
2000
14 years 10 months ago
2000
An increasing number of applications are being developed using distributed object computing middleware, such as CORBA. Many of these applications require the underlying middleware...