15 search results - page 1 / 3 » Improving Stochastic Local Search for SAT with a New Probabi... |
SAT
2010
Springer
13 years 8 months ago
2010
Springer
AUSAI
2007
Springer
13 years 8 months ago
2007
Springer
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...
EVOW
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
AI
2005
Springer
13 years 4 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...