16 search results - page 4 / 4 » Weighted Hypertree Decompositions and Optimal Query Plans |
CP
2007
Springer
14 years 5 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...