Pages that link to "Item:Q1581848"
From MaRDI portal
The following pages link to Local search algorithms for SAT: an empirical evaluation (Q1581848):
Displaying 35 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)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← 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)
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (Q1606317) (← links)
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (Q1777395) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- SAT local search algorithms: Worst-case study (Q1977754) (← 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)
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998) (Q2726305) (← links)
- SatEx: A web-based framework for SAT experimentation (Q2741519) (← links)
- Auto-Walksat: A self-tuning implementation of Walksat (Q2741537) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q2749854) (← links)
- SAT local search algorithms: Worst-case study (Q2749857) (← links)
- Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT (Q3172891) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (Q3502713) (← links)
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (Q3569759) (← links)
- (Q3604003) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- Local search algorithms for SAT: Worst-case analysis (Q5054860) (← links)
- Artificial Intelligence and Symbolic Computation (Q5464698) (← links)
- (Q5687271) (← links)
- Theory and Applications of Satisfiability Testing (Q5713711) (← links)
