660 search results - page 14 / 132 » Hybrid CSP Solving |
130
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
117
Voted
AIMSA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
111
click to vote
SAT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
120
click to vote
CP
2001
Springer
15 years 6 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
112
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...