793 search results - page 80 / 159 » Argumentation and standards of proof |
108
click to vote
PPDP
2009
Springer
15 years 7 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
92
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— This paper considers a network flow control problem where routing and input rates are controlled in a decentralized way across a network, to optimize a global welfare objectiv...
115
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
125
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
CP
2004
Springer
15 years 6 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...