Sciweavers

146 search results - page 4 / 30
» Fault-Tolerant Distributed Theorem Proving
Sort
View
MOBIHOC
2010
ACM
13 years 5 months ago
Data preservation under spatial failures in sensor networks
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...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
RSFDGRC
2005
Springer
151views Data Mining» more  RSFDGRC 2005»
14 years 25 days ago
DIXER - Distributed Executor for Rough Set Exploration System
We present the Distributed Executor for RSES (DIXER) which is a supplementary software for the Rough Set Exploration System (RSES). It takes an advantage of grid computing paradigm...
Jan G. Bazan, Rafal Latkowski, Marcin S. Szczuka
PODC
2012
ACM
11 years 9 months ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 7 months ago
On Byzantine Containment Properties of the $min+1$ Protocol
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
EACL
1989
ACL Anthology
13 years 8 months ago
Lambek Theorem Proving And Feature Unification
CT Feature Unification can be integrated with Lambek Theorem Proving in a simple and straightforward way. Two principles determine all distribution of features in LTP. It is not ne...
Erik-Jan van der Linden