Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT


In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conceptually simple combinatorial problem of substantial theoretical and practical interest; many application-relevant problems, including scheduling problems or most probable explanation… (More)
DOI: 10.1007/3-540-44886-1_13
View Slides