Sciweavers

882 search results - page 7 / 177
» Local Search for Very Large SAT Problems
Sort
View
AUSAI
2007
Springer
13 years 11 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 7 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...
ICML
2003
IEEE
14 years 8 months ago
Stochastic Local Search in k-Term DNF Learning
A novel native stochastic local search algorithm for solving k-term DNF problems is presented. It is evaluated on hard k-term DNF problems that lie on the phase transition and com...
Stefan Kramer, Ulrich Rückert
IJCAI
2007
13 years 8 months ago
Building Structure into Local Search for SAT
Local search procedures for solving satisfiability problems have attracted considerable attention since the development of GSAT in 1992. However, recent work indicates that for m...
Duc Nghia Pham, John Thornton, Abdul Sattar
AI
1999
Springer
13 years 7 months ago
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
Holger H. Hoos, Thomas Stützle