Pages that link to "Item:Q1581848"
From MaRDI portal
The following pages link to Local search algorithms for SAT: an empirical evaluation (Q1581848):
Displayed 19 items.
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Learning dynamic algorithm portfolios (Q870809) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← links)
- Modelling the dynamics of stochastic local search on \(k\)-SAT (Q930153) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Understanding the role of noise in stochastic local search: analysis and experiments (Q2389642) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem (Q2468764) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- (Q2741519) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)