Sciweavers

14 search results - page 3 / 3
» jsat 2008
Sort
View
JSAT
2008
113views more  JSAT 2008»
13 years 4 months ago
Combining Adaptive and Dynamic Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on the features...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
JSAT
2008
63views more  JSAT 2008»
13 years 4 months ago
Whose side are you on? Finding solutions in a biased search-tree
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
Marijn Heule, Hans van Maaren
JSAT
2008
122views more  JSAT 2008»
13 years 4 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
JSAT
2008
99views more  JSAT 2008»
13 years 4 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang