Sciweavers

277 search results - page 39 / 56
» Fault tolerance using group communication
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
DSE
1998
80views more  DSE 1998»
13 years 7 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava
IJNSEC
2010
66views more  IJNSEC 2010»
13 years 2 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald
SWARM
2008
SPRINGER
115views Optimization» more  SWARM 2008»
13 years 7 months ago
Path formation in a robot swarm
We present two swarm intelligence control mechanisms used for distributed robot path formation. In the first, the robots form linear chains. We study three variants of robot chains...
Shervin Nouyan, Alexandre Campo, Marco Dorigo
DATE
2008
IEEE
223views Hardware» more  DATE 2008»
14 years 2 months ago
Cooperative Safety: a Combination of Multiple Technologies
—Governmental Transportation Authorities' interest in Car to Car and Car to Infrastructure has grown dramatically over the last few years in order to increase the road safet...
Raffaele Penazzi, Piergiorgio Capozio, Martin Dunc...