Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
From MaRDI portal
Publication:1606317
DOI10.1016/S0004-3702(99)00048-XzbMath0996.68069OpenAlexW1987703212WikidataQ59586173 ScholiaQ59586173MaRDI QIDQ1606317
Thomas Stützle, Holger H. Hoos
Publication date: 24 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00048-x
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
An algorithm based on tabu search for satisfiability problem, A hybrid data mining GRASP with path-relinking, A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction, Understanding the role of noise in stochastic local search: analysis and experiments, An effective hybrid algorithm for university course timetabling, Analysis of local search landscapes for \(k\)-SAT instances, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, Finding rough and fuzzy-rough set reducts with SAT, The minimum shift design problem, TTT plots: a perl program to create time-to-target plots, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, Measuring instance difficulty for combinatorial optimization problems, Large-scale parallelism for constraint-based local search: the costas array case study
Uses Software
