209 search results - page 2 / 42 » The Computational Complexity of Weak Saddles |
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
NIPS
2007
13 years 6 months ago
2007
Dynamic Bayesian networks are structured representations of stochastic processes. Despite their structure, exact inference in DBNs is generally intractable. One approach to approx...
ICDCS
2010
IEEE
13 years 5 months ago
2010
IEEE
—In this paper, we classify multitolerant systems, i.e., systems that tolerate multiple classes of faults and provide potentially different levels of tolerance to them in terms o...
COCO
2009
Springer
13 years 12 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...
SAGA
2007
Springer
13 years 11 months ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...