5153 search results - page 733 / 1031 » Introduction to Randomized Algorithms |
152
Voted
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
128
click to vote
CP
1998
Springer
15 years 8 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
188
Voted
STOC
1998
ACM
15 years 8 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
148
click to vote
CP
1997
Springer
15 years 8 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
140
Voted
COLT
1992
Springer
15 years 8 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...