989 search results - page 55 / 198 » Pebbling and Proofs of Work |
FORMATS
2003
Springer
14 years 1 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
CSR
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
MDM
2010
Springer
14 years 1 months ago
2010
Springer
Abstract—Data-based agreement is increasingly used to implement traceable coordination across mobile entities such as adhoc networked (autonomous) vehicles. In our work, we focus...
EUROGP
2001
Springer
14 years 22 days ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
TPHOL
2000
IEEE
14 years 19 days ago
2000
IEEE
We provide a proof using HOL and SPIN of convergence for the Routing Information Protocol (RIP), an internet protocol based on distance vector routing. We also calculate a sharp re...