1041 search results - page 137 / 209 » Randomizing Reductions of Search Problems |
CP
1998
Springer
14 years 2 days 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...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
Dealing with verbose (or long) queries poses a new challenge for information retrieval. Selecting a subset of the original query (a "sub-query") has been shown to be an ...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
CP
2001
Springer
14 years 10 days ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...