1450 search results - page 130 / 290 » On the Complexity of Hardness Amplification |
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— Power dissipation has constrained the performance boosting of modern computer systems in the past decade. Dynamic power management (DPM) has been implemented in many sy...
COCO
2001
Springer
14 years 1 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
SRDS
1993
IEEE
14 years 1 months ago
1993
IEEE
We propose a simple and practical probabilistic comparison-based model, employing multiple incomplete test concepts, for handling fault location in distributed systems using a Bay...
ECAI
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. The configuration of Web services is particularly hard given the heterogeneous, unreliable and open nature of the Web. Furthermore, such composite Web services are likely...
AAAI
2008
13 years 11 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...