197 search results - page 20 / 40 » Advances in Local Search for Satisfiability |
105
Voted
AAAI
2004
15 years 1 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
110
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
108
Voted
RECOMB
2004
Springer
16 years 23 days ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
106
Voted
ECIR
2007
Springer
15 years 1 months ago
2007
Springer
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
125
Voted
UAI
2000
15 years 1 months ago
2000
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...