Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP.
David AlloucheSimon de GivryGeorge KatsirelosThomas SchiexMatthias ZytnickiPublished in: CP (2015)
Keyphrases
- tree decomposition
- branch and bound
- tree width
- constraint networks
- decomposition method
- tree decompositions
- constraint satisfaction problems
- probabilistic reasoning
- lower bound
- search algorithm
- parallel processing
- graph theory
- reasoning problems
- answer set programming
- optimal solution
- heuristic search
- upper bound
- decomposition methods
- branch and bound search
- search space
- tree search
- machine learning
- combinatorial optimization
- hypertree decomposition
- search strategies
- search tree
- probabilistic inference
- search strategy
- orders of magnitude
- np hard
- bayesian networks