230 search results - page 24 / 46 » Quantum Search with Variable Times |
116
Voted
AAAI
1996
15 years 1 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
121
Voted
PDP
2008
IEEE
15 years 6 months ago
2008
IEEE
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
99
Voted
EVOW
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
106
click to vote
AI
1999
Springer
15 years 3 days ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
STOC
2003
ACM
16 years 21 days ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...