5115 search results - page 725 / 1023 » On Randomized Lanczos Algorithms |
150
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
162
click to vote
AI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
189
click to vote
COCO
1998
Springer
15 years 10 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...
169
click to vote
CP
1998
Springer
15 years 10 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...
228
click to vote
STOC
1998
ACM
15 years 10 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...