793 search results - page 86 / 159 » Argumentation and standards of proof |
114
click to vote
STOC
2004
ACM
16 years 29 days ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
137
click to vote
COCO
2009
Springer
15 years 7 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
82
Voted
CSR
2007
Springer
15 years 6 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
96
Voted
TOPLAS
2008
15 years 16 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
83
Voted
IJMMS
1998
15 years 10 days ago
1998
Clancey (1992) proposed the model-construction framework as a way to explain the reasoning of knowledge-based systems (KBSs), based on his realization that all KBSs construct impl...