IJCAI
2007
13 years 6 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
ISMIS
2000
Springer
13 years 8 months ago
2000
Springer
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
VLDB
1999
ACM
13 years 8 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
ICTAI
2003
IEEE
13 years 9 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
CG
2004
Springer
13 years 10 months ago
2004
Springer
In this paper a new method is described for move ordering, called the relative history heuristic. It is a combination of the history heuristic and the butterfly heuristic. Instead...
CPAIOR
2005
Springer
13 years 10 months ago
2005
Springer
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
ACG
2006
Springer
13 years 10 months ago
2006
Springer
A plethora of enhancements are available to be used together with the αβ search algorithm. There are so many, that their selection and implementation is a non-trivial task, even ...
CPAIOR
2007
Springer
13 years 10 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...