784 search results - page 60 / 157 » Histogram-based search: A comparative study |
133
click to vote
IJCAI
2003
15 years 5 months ago
2003
We study two apparently different, but formally similar, scheduling problems. The first problem involves contract algorithms, which can trade off run time for solution quality, a...
114
click to vote
AIPS
2010
15 years 6 months ago
2010
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
125
click to vote
ANLP
1997
15 years 5 months ago
1997
Statistical models of word-sense disambiguation are often based on a small number of contextual features or on a model that is assumed to characterize the interactions among a set...
139
click to vote
JCO
2007
15 years 4 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
138
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...