50 search results - page 7 / 10 » Best-First Search for Treewidth |
FCT
2003
Springer
14 years 18 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
AIPS
2006
13 years 8 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
CP
2007
Springer
14 years 1 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...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
In this paper weshowthat parallel search techniquesderived fromtheir sequential counterparts can enable the solution of instances of the robot motionplanningproblemthat are comput...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...