Login / Signup
A Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search.
Tobias Friedrich
Timo Kötzing
Markus Wagner
Published in:
AAAI (2017)
Keyphrases
</>
stochastic local search
satisfiability problem
phase transition
solving hard
max sat
combinatorial optimisation
random sat instances
quadratic assignment problem
randomly generated
computationally hard problems
information retrieval
np complete
branch and bound