2 search results - page 1 / 1 » Structural Relaxations by Variable Renaming and Their Compil... |
CP
2007
Springer
13 years 11 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...
CGO
2011
IEEE
12 years 9 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...