Sciweavers

11 search results - page 2 / 3
» Neighbourhood Clause Weight Redistribution in Local Search f...
Sort
View
AUSAI
2003
Springer
13 years 10 months ago
Estimating Problem Metrics for SAT Clause Weighting Local Search
Wayne J. Pullan, Liang Zhao, John Thornton
AAAI
2004
13 years 6 months ago
Additive versus Multiplicative Clause Weighting for SAT
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
John Thornton, Duc Nghia Pham, Stuart Bain, Valnir...
SAT
2005
Springer
95views Hardware» more  SAT 2005»
13 years 10 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich
AUSAI
2007
Springer
13 years 9 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
JSAT
2008
113views more  JSAT 2008»
13 years 5 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...