The following pages link to (Q3624109):
Displaying 31 items.
- MiniMaxSat (Q21711) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- A framework for reasoning under uncertainty based on non-deterministic distance semantics (Q541819) (← links)
- Simplified forms of computerized reasoning with distance semantics (Q545150) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Computational protein design as an optimization problem (Q2453727) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (Q3007689) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Modelling Max-CSP as Partial Max-SAT (Q3502687) (← links)
- A Preprocessor for Max-SAT Solvers (Q3502688) (← links)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (Q3502710) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)