244 search results - page 4 / 49 » A Linear Search Strategy using Bounds |
FOCS
1994
IEEE
14 years 24 days ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
IJCAI
1997
13 years 10 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
ASP
2005
Springer
14 years 2 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
SCALESPACE
2007
Springer
14 years 2 months ago
2007
Springer
The reconstruction problem is usually formulated as a variational problem in which one searches for that image that minimizes a so called prior (image model) while insisting on cer...
AAAI
2006
13 years 10 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...