3208 search results - page 395 / 642 » A Lower Bound for Primality |
151
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...
194
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
156
click to vote
AAAI
2010
15 years 8 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
172
click to vote
AAAI
2010
15 years 8 months ago
2010
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
177
click to vote
ADHOCNOW
2010
Springer
15 years 8 months ago
2010
Springer
We consider the problem of efficient alarm protocol for ad-hoc radio networks consisting of devices that try to gain access for transmission through a shared radio communication ch...