5084 search results - page 134 / 1017 » Proving Possibility Properties |
158
click to vote
FORMATS
2004
Springer
15 years 9 months ago
2004
Springer
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...
112
click to vote
AAAI
1990
15 years 6 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
177
click to vote
ALGORITHMICA
2006
15 years 5 months ago
2006
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
149
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
153
click to vote
DAM
2007
15 years 5 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...