Shaowei Cai

最新

• A fast test compaction method using dedicated Pure MaxSAT solver embedded in DFT flow
• Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis
• Leveraging Critical Proof Obligations for Efficient IC3 Verification
• Optimizing local search-based partial MaxSAT solving via initial assignment prediction
• Parallel MIP Solving with Dynamic Task Decomposition
• X-SAT: An Efficient Circuit-Based SAT Solver
• A Fast Test Compaction Method for Commercial DFT Flow Using Dedicated Pure-MaxSAT Solver
• A Local Search Algorithm for MaxSMT(LIA)
• A local search approach to protocol verification
• An Efficient Local Search Solver for Mixed Integer Programming
• AutoSAT: Automatically Optimize SAT Solvers via Large Language Models
• Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
• Bi-Objective Contract Allocation for Guaranteed Delivery Advertising
• Deep Combination of CDCL(T) and Local Search for Satisfiability Modulo Non-Linear Integer Arithmetic Theory
• Distributed SMT Solving Based on Dynamic Variable-Level Partitioning
• Efficient Local Search for Nonlinear Real Arithmetic
• Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
• Goal-conflict identification based on local search and fast boundary-condition verification based on incremental satisfiability filter
• Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
• Local Search for Integer Quadratic Programming
• NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem
• OPTDTALS: Approximate Logic Synthesis via Optimal Decision Trees Approach
• ParaILP: A Parallel Local Search Framework for Integer Linear Programming with Cooperative Evolution Mechanism
• ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
• PathLAD+: Towards effective exact methods for subgraph isomorphism problem
• Revisiting Restarts of CDCL: Should the Search Information be Preserved?
• CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
• Generating Pairwise Covering Arrays for Highly Configurable Software Systems
• Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism. Artif. Intell. 314: 103819 (2023)
• Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization
• Integrating Exact Simulation into Sweeping for Datapath Combinational Equivalence Checking
• Local Search For Satisfiability Modulo Integer Arithmetic Theories
• Local Search For SMT On Linear and Multi-linear Real Arithmetic
• NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques
• On EDA-Driven Learning for SAT Solving
• PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem
• Towards more efficient local search algorithms for constrained clustering Inf. Sci. 621: 287-307 (2023)
• Better Decision Heuristics in CDCL through Local Search and Target Phases J. Artif. Intell. Res. 74: 1515-1563 (2022)
• Deep Cooperation of CDCL and Local Search for SAT (Extended Abstract) 2022: 5274-5278
• Improving Local Search Algorithms via Probabilistic Configuration Checking AAAI 2022: 10283-10290
• Improving Simulated Annealing for Clique Partitioning Problems Intell. Res. 74: 1485-1513 (2022)
• Local Search For Satisfiability Modulo Integer Arithmetic Theories (2022)
• Local Search for SMT on Linear Integer Arithmetic
• NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem
• SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systems. ESEC/SIGSOFT FSE 2022: 1185-1197
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72: 39-67 (2021)
• AutoCCAG: An Automated Approach to Constrained Covering Array Generation ICSE 2021: 201-212
• Can Graph Neural Networks Learn to Solve MaxSAT Problem?
• Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems
• Deep Cooperation of CDCL and Local Search for SAT
• Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set. J. Artif. Intell. Res. 71: 89-119 (2021)
• Efficient Local Search for Pseudo Boolean Optimization
• FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation ICSE (Companion Volume) 2021: 77-80
• Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search. CP 2021: 39:1-39:16
• Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). CP 2021: 5:1-5:10
• NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021: 12258-12266
• PULNS: Positive-Unlabeled Learning with Effective Negative Sample Selector AAAI 2021: 8784-8792
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs. J. Comb. Optim. 39(4): 933-954 (2020)
• Efficient incident identification from multi-dimensional issue reports via meta-heuristic search. ESEC/SIGSOFT FSE 2020: 292-303
• Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints. IJCAI 2020: 1141-1147
• Local Search with Dynamic-Threshold Configuration Checking and Incremental Neighborhood Updating for Maximum k-plex Problem
• NLocalSAT: Boosting Local Search with Solution Prediction
• NLocalSAT: Boosting Local Search with Solution Prediction
• NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510
• NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT Comput. J. 63(9): 1321-1337 (2020)
• NuMWVC: A novel local search for minimum weighted vertex cover problem Oper. Res. Soc. 71(9): 1498-1509 (2020)
• Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability. Artif. Intell. 287: 103354 (2020)
• PbO-CCSAT: Boosting Local Search for Satisfiability Using Programming by Optimisation PPSN (1) 2020: 373-389
• Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search. CP 2020: 90-106
• Reduction and Local Search for Weighted Graph Coloring Problem
• SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. Artif. Intell. 280: 103230 (2020)
• Solving Set Cover and Dominating Set via Maximum Satisfiability
• Two-goal Local Search and Inference Rules for Minimum Dominating Set 2020: 1467-1473
• WCA: A weighting local search for constrained combinatorial test optimization Inf. Softw. Technol. 122: 106288 (2020)
• A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation. Artif. Intell. 276: 105-129 (2019)
• Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem.
• Constrained maximum weighted bipartite matching: a novel approach to radio broadcast scheduling. Sci. China Inf. Sci. 62(7): 72102:1-72102:14 (2019)
• Empirical investigation of stochastic local search for maximum satisfiability Frontiers Comput. Sci. 13(1): 86-98 (2019)
• Local Search with Efficient Automatic Configuration for Minimum Vertex Cover IJCAI 2019: 1297-1304
• Towards faster local search for minimum weight vertex cover on massive graphs Inf. Sci. 471: 64-79 (2019)
• Towards more efficient meta-heuristic algorithms for combinatorial test generation ESEC/SIGSOFT FSE 2019: 212-222
• A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs. IJCAI 2018: 1514-1522
• An Automatic Proving Approach to Parameterized Verification Log. 19(4): 27:1-27:25 (2018)
• Efficient zonal diagnosis with maximum satisfiability 61(11): 112101:1-112101:14 (2018)
• FPGA Acceleration to Solve Maximum Clique Problems Encoded into Partial MaxSAT MCSoC 2018: 217-224
• Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018: 1412-1418
• New heuristic approaches for maximum balanced biclique problem 432: 362-375 (2018)
• NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem
• Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT 1346-1352
• A Reduction based Method for Coloring Very Large Graphs
• An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs. SEAL 2017: 145-157
• An efficient local search algorithm for the winner determination problem J. Heuristics 23(5): 367-396 (2017)
• CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract). IJCAI 2017: 5030-5034
• Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search and Preprocess
• From Decimation to Local Search and Back: A New Approach to MaxSAT 2017: 571-577
• Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function.
• Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. TAMC 2017: 59-70
• A novel approach to parameterized verification of cache coherence protocols ICCD 2016: 560-567
• An FPGA Solver for Partial MaxSAT Problems Based on Stochastic Local Search SIGARCH Comput. Archit. News 44(4): 32-37 (2016)
• Fast Solving Maximum Weight Clique Problem in Massive Graphs 568-574
• New local search methods for partial MaxSAT
• Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
• An effective variable selection heuristic in SLS for weighted Max-2-SAT Heuristics 21(3): 433-456 (2015)
• An I/O Efficient Approach for Detecting All Accepting Cycles Software Eng. 41(8): 730-744 (2015)
• An I/O Efficient Model Checking Algorithm for Large-Scale Systems Very Large Scale Integr. Syst. 23(5): 905-915 (2015)
• Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs. IJCAI 2015: 747-753
• CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability SAT 2015: 1-8
• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability IEEE Trans. Computers 64(7): 1830-1843 (2015)
• Clause States Based Configuration Checking in Local Search for Satisfiability IEEE Trans. Cybern. 45(5): 1014-1027 (2015)
• Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation Comput. J. 58(11): 2864-2875 (2015)
• TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T). ASE 2015: 494-505
• Two Weighting Local Search for Minimum Vertex Cover
• Double Configuration Checking in Stochastic Local Search for Satisfiability AAAI 2014: 2703-2709
• More efficient two-mode stochastic local search for random 3-satisfiability Appl. Intell. 41(3): 665-680 (2014)
• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover abs/1402.0584 (2014)
• Scoring Functions Based on Second Level Score for k-SAT with Long Clauses J. Artif. Intell. Res. 51: 413-441 (2014)
• Tailoring Local Search for Partial MaxSAT
• A clique-superposition model for social networks 1-19 (2013)
• Local search for Boolean Satisfiability with configuration checking and subscore Artif. Intell. 204: 75-98 (2013)
• NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover Intell. Res. 46: 687-716 (2013)
• Towards More Efficient Local Search for Pseudo-Boolean Optimization