Pages that link to "Item:Q1606317"
From MaRDI portal
The following pages link to Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (Q1606317):
Displaying 22 items.
- A hybrid data mining GRASP with path-relinking (Q336726) (← links)
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
- Finding rough and fuzzy-rough set reducts with SAT (Q497893) (← links)
- Analysis of local search landscapes for \(k\)-SAT instances (Q626907) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- A probabilistic algorithm for \(k\)-SAT based on limited local search and restart (Q1348911) (← links)
- Computation of the semantics of autoepistemic belief theories (Q1606318) (← links)
- An algorithm based on tabu search for satisfiability problem (Q1613279) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← 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)
- The minimum shift design problem (Q2468734) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- Stochastic local search - methods, models, applications (Diss., TU Darmstadt, 1998) (Q2726305) (← links)
- Stochastic systematic search algorithms for satisfiability (Q2741524) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q2749854) (← links)
- SAT local search algorithms: Worst-case study (Q2749857) (← links)
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (Q3569759) (← links)
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search (Q5398300) (← links)
