The following pages link to Walksat (Q16507):
Displaying 50 items.
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- Computing the moments \(k\)-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time (Q418028) (← links)
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Monitoring and recovery for web service applications (Q488218) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Two approximate algorithms for model counting (Q507433) (← links)
- State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming (Q657572) (← links)
- New methods for proving the impossibility to solve problems through reduction of problem spaces (Q693286) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- A parallelization scheme based on work stealing for a class of SAT solvers (Q812442) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Learning from planner performance (Q835821) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings (Q862408) (← links)
- The island confinement method for reducing search space in local search methods (Q930151) (← links)
- Principles and practice of constraint programming -- CP 2005. 11th international conference, CP 2005, Sitges, Spain, October 1--5, 2005. Proceedings (Q932900) (← links)
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself (Q959049) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Boosting complete techniques thanks to local search methods (Q1267775) (← links)
- Integer optimization by local search. A domain-independent approach (Q1301506) (← links)
- Analyses on the 2 and 3-flip neighborhoods for the MAX SAT (Q1304388) (← links)
- Trace-based methods for solving nonlinear global optimization and satisfiability problems (Q1359099) (← links)
- A discrete Lagrangian-based global-search method for solving satisfiability problems (Q1383842) (← links)
- A tabu search heuristic for resource management in naval warfare (Q1402516) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Local search algorithms for SAT: an empirical evaluation (Q1581848) (← links)
- A Lagrangian reconstruction of GENET (Q1589464) (← links)
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (Q1606317) (← links)
- Computation of the semantics of autoepistemic belief theories (Q1606318) (← links)
- Extracting mutual exclusion invariants from lifted temporal planning domains (Q1639696) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- An improved SAT formulation for the social golfer problem (Q1761920) (← links)
- Planning as propositional CSP: From Walksat to local search techniques for action graphs (Q1768745) (← links)
