Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

DOI10.1007/978-3-642-31612-8_3zbMath1273.68333OpenAlexW167199924MaRDI QIDQ2843318

Adrian Balint, Uwe Schoening

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_3

Mathematics Subject Classification ID

Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (8)

SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ Propagation based local search for bit-precise reasoning ⋮ Local Search For Satisfiability Modulo Integer Arithmetic Theories ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ Local search for Boolean satisfiability with configuration checking and subscore ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ The configurable SAT solver challenge (CSSC) ⋮ XOR local search for Boolean Brent equations

This page was built for publication: Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break