1047 search results - page 9 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Users increasingly rely on their mobile devices to search local entities, typically businesses, while on the go. Even though recent work has recognized that the ranking signals in...
CI
1998
13 years 7 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
FLAIRS
2008
13 years 10 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
AUSAI
2010
Springer
13 years 5 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
CONSTRAINTS
2006
13 years 7 months ago
2006
Abstract. The heavy-tailed phenomenon that characterises the runtime distributions of backtrack search procedures has received considerable attention over the past few years. Some ...