Pages that link to "Item:Q490437"
From MaRDI portal
The following pages link to Local search for Boolean satisfiability with configuration checking and subscore (Q490437):
Displayed 17 items.
- CCASat (Q24847) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Improving configuration checking for satisfiable random \(k\)-SAT instances (Q513324) (← links)
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem (Q1725596) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Timescales of Boolean satisfiability solver using continuous-time dynamical system (Q2204452) (← links)
- An efficient local search framework for the minimum weighted vertex cover problem (Q2282264) (← 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)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- Local Search For Satisfiability Modulo Integer Arithmetic Theories (Q6082229) (← links)