Pages that link to "Item:Q2982183"

The following pages link to CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability (Q2982183):

Displaying 27 items.

• CCLS (Q51751) (← links)
• New local search methods for partial MaxSAT (Q329035) (← links)
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
• WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
• An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
• Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
• Cooperative parallel SAT local search with path relinking (Q2057122) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
• An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
• Local search for diversified top-\(k\) clique search problem (Q2289947) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← 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)
• Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (Q3453234) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• Breaking Cycle Structure to Improve Lower Bound for Max-SAT (Q4632177) (← links)
• Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
• New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445) (← links)
• MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)