660 search results - page 4 / 132 » Hybrid CSP Solving |
167
click to vote
CP
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
133
click to vote
AAAI
1997
15 years 6 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
131
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
183
click to vote
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...