27 search results - page 6 / 6 » Variable-Selection Heuristics in Local Search for SAT |
161
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
185
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...