The following pages link to Shaowei Cai (Q329032):
Displaying 28 items.
- New local search methods for partial MaxSAT (Q329035) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- New heuristic approaches for maximum balanced biclique problem (Q781924) (← links)
- Deep cooperation of CDCL and local search for SAT (Q2118286) (← links)
- Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
- An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
- Towards faster local search for minimum weight vertex cover on massive graphs (Q2200662) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation (Q2289008) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- Scoring Functions Based on Second Level Score for k-SAT with Long Clauses (Q2929584) (← links)
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Q2962573) (← links)
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability (Q2982183) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)
- (Q3455584) (← links)
- An Automatic Proving Approach to Parameterized Verification (Q4617972) (← links)
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover (Q4917618) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- A clique-superposition model for social networks (Q5018224) (← links)
- Improving Simulated Annealing for Clique Partitioning Problems (Q5101310) (← links)
- Better Decision Heuristics in CDCL through Local Search and Target Phases (Q5101311) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess (Q5370992) (← links)
- A local search approach to protocol verification (Q6589831) (← links)
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem (Q6665697) (← links)
