Login / Signup
Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks.
Christopher D. Rosin
Published in:
CoRR (2014)
Keyphrases
</>
stochastic local search
randomly generated
max sat
constraint satisfaction problems
sat problem
random sat instances
satisfiability problem
upper bound
np complete