520 search results - page 97 / 104 » New Complexity Results for Classical Planning Benchmarks |
112
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
133
click to vote
ZUM
1997
Springer
15 years 4 months ago
1997
Springer
We present a new formal OO method, called FOX, which is a synergetic combination of the semi-formal Fusion method and the formal specification language Object-Z. To manage complex...
123
Voted
INFORMS
1998
15 years 3 days ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
126
click to vote
EDBT
2011
ACM
14 years 4 months ago
2011
ACM
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
191
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
We wish to determine the epipolar geometry of a stereo camera pair from image measurements alone. This paper describes a solution to this problem which does not require a parametr...