769 search results - page 30 / 154 » Where Is the Proof |
133
click to vote
SIROCCO
2010
15 years 5 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
118
click to vote
JAT
2010
15 years 2 months ago
2010
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
155
click to vote
AMAI
1999
Springer
15 years 3 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
162
click to vote
ASIACRYPT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
165
click to vote
CADE
2005
Springer
16 years 4 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...