13 search results - page 1 / 3 » Longer-Term Memory in Clause Weighting Local Search for SAT |
AUSAI
2004
Springer
14 years 4 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...
CP
2008
Springer
14 years 20 days 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...
CP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
AUSAI
2003
Springer
14 years 4 months ago
2003
Springer
SAT
2004
Springer
14 years 4 months ago
2004
Springer
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...