146 search results - page 27 / 30 » Fault-Tolerant Distributed Theorem Proving |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
PPDP
2005
Springer
14 years 3 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
SIGMETRICS
2004
ACM
14 years 3 months ago
2004
ACM
The use of environmental energy is now emerging as a feasible energy source for embedded and wireless computing systems such as sensor networks where manual recharging or replacem...
PPOPP
2003
ACM
14 years 3 months ago
2003
ACM
We present a new method for dynamically detecting potential data races in multithreaded programs. Our method improves on the state of the art in accuracy, in usability, and in ove...
DAM
2011
13 years 4 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...