27 search results - page 6 / 6 » Variable-Selection Heuristics in Local Search for SAT |
AI
2000
Springer
13 years 5 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...
CP
2006
Springer
13 years 9 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...