470 search results - page 40 / 94 » Tabu Search for SAT |
CP
2008
Springer
13 years 9 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
AAAI
2008
13 years 10 months ago
2008
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
AUSAI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
ASPDAC
2004
ACM
13 years 11 months ago
2004
ACM
Abstract