62 search results - page 6 / 13 » A Complete Multi-valued SAT Solver |
AAAI
2004
13 years 9 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
CP
2003
Springer
14 years 21 days ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
ICSE
2007
IEEE-ACM
14 years 7 months ago
2007
IEEE-ACM
Linux distributions often include package management tools such as apt-get in Debian or yum in RedHat. Using information about package dependencies and conflicts, such tools can d...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...