Shaowei Cai

Affiliations:
  • Chinese Academy of Sciences, Institute of Software, State Key Laboratory of Computer Science, Beijing, China
  • University of Chinese Academy of Sciences, School of Computer Science and Technology, Beijing, China
  • Peking University, Key Laboratory of High Confidence Software Technologies (former, PhD 2012)


According to our database1, Shaowei Cai authored at least 113 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem.
IEEE Trans. Cybern., March, 2024

Improving two-mode algorithm via probabilistic selection for solving satisfiability problem.
Inf. Sci., January, 2024

AutoSAT: Automatically Optimize SAT Solvers via Large Language Models.
CoRR, 2024

Efficient Local Search for Nonlinear Real Arithmetic.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

2023
Local Search For Satisfiability Modulo Integer Arithmetic Theories.
ACM Trans. Comput. Log., October, 2023

Towards more efficient local search algorithms for constrained clustering.
Inf. Sci., April, 2023

Preface to the Special Issue on Constraint Solving and Theorem Proving.
Int. J. Softw. Informatics, 2023

Local Search for Integer Linear Programming.
CoRR, 2023

Local Search For SMT On Linear and Multilinear Real Arithmetic.
CoRR, 2023

Incremental Satisfiability Modulo Theory for Verification of Deep Neural Networks.
CoRR, 2023

Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism.
Artif. Intell., 2023

Generating Pairwise Covering Arrays for Highly Configurable Software Systems.
Proceedings of the 27th ACM International Systems and Software Product Line Conference, 2023

CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Integrating Exact Simulation into Sweeping for Datapath Combinational Equivalence Checking.
Proceedings of the IEEE/ACM International Conference on Computer Aided Design, 2023

Local Search For SMT On Linear and Multi-linear Real Arithmetic.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

Local Search and Its Application in CDCL/CDCL(T) solvers for SAT/SMT.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

On EDA-Driven Learning for SAT Solving.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023

Improving Local Search for Pseudo Boolean Optimization by Fragile Scoring Function and Deep Optimization.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Towards More Efficient Local Search for Pseudo-Boolean Optimization.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Can Graph Neural Networks Learn to Solve the MaxSAT Problem? (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Improving Simulated Annealing for Clique Partitioning Problems.
J. Artif. Intell. Res., 2022

Better Decision Heuristics in CDCL through Local Search and Target Phases.
J. Artif. Intell. Res., 2022

SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systems.
Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2022

Deep Cooperation of CDCL and Local Search for SAT (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Local Search for SMT on Linear Integer Arithmetic.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Improving Local Search Algorithms via Probabilistic Configuration Checking.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set.
J. Artif. Intell. Res., 2021

A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.
J. Artif. Intell. Res., 2021

Can Graph Neural Networks Learn to Solve MaxSAT Problem?
CoRR, 2021

Efficient Local Search for Pseudo Boolean Optimization.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Deep Cooperation of CDCL and Local Search for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

AutoCCAG: An Automated Approach to Constrained Covering Array Generation.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering: Companion Proceedings, 2021

Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper).
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

PULNS: Positive-Unlabeled Learning with Effective Negative Sample Selector.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
NuMWVC: A novel local search for minimum weighted vertex cover problem.
J. Oper. Res. Soc., 2020

An efficient local search algorithm for solving maximum edge weight clique problem in large graphs.
J. Comb. Optim., 2020

WCA: A weighting local search for constrained combinatorial test optimization.
Inf. Softw. Technol., 2020

NuDist: An Efficient Local Search Algorithm for (Weighted) Partial MaxSAT.
Comput. J., 2020

SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem.
Artif. Intell., 2020

Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability.
Artif. Intell., 2020

Efficient incident identification from multi-dimensional issue reports via meta-heuristic search.
Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020

PbO-CCSAT: Boosting Local Search for Satisfiability Using Programming by Optimisation.
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020

NLocalSAT: Boosting Local Search with Solution Prediction.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Two-goal Local Search and Inference Rules for Minimum Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Reduction and Local Search for Weighted Graph Coloring Problem.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Solving Set Cover and Dominating Set via Maximum Satisfiability.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Local Search with Dynamic-Threshold Configuration Checking and Incremental Neighborhood Updating for Maximum k-plex Problem.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Towards faster local search for minimum weight vertex cover on massive graphs.
Inf. Sci., 2019

Empirical investigation of stochastic local search for maximum satisfiability.
Frontiers Comput. Sci., 2019

Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem.
CoRR, 2019

Constrained maximum weighted bipartite matching: a novel approach to radio broadcast scheduling.
Sci. China Inf. Sci., 2019

A set of new multi- and many-objective test problems for continuous optimization and a comprehensive experimental evaluation.
Artif. Intell., 2019

Towards more efficient meta-heuristic algorithms for combinatorial test generation.
Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019

Local Search with Efficient Automatic Configuration for Minimum Vertex Cover.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
An Automatic Proving Approach to Parameterized Verification.
ACM Trans. Comput. Log., 2018

New heuristic approaches for maximum balanced biclique problem.
Inf. Sci., 2018

Efficient zonal diagnosis with maximum satisfiability.
Sci. China Inf. Sci., 2018

FPGA Acceleration to Solve Maximum Clique Problems Encoded into Partial MaxSAT.
Proceedings of the 12th IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip, 2018

A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

NuMWVC: A Novel Local Search for Minimum Weighted Vertex Cover Problem.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function.
J. Artif. Intell. Res., 2017

Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess.
J. Artif. Intell. Res., 2017

An efficient local search algorithm for the winner determination problem.
J. Heuristics, 2017

CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability.
Artif. Intell., 2017

Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis.
Proceedings of the Theory and Applications of Models of Computation, 2017

An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs.
Proceedings of the Simulated Evolution and Learning - 11th International Conference, 2017

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract).
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

A Reduction based Method for Coloring Very Large Graphs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

From Decimation to Local Search and Back: A New Approach to MaxSAT.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
An FPGA Solver for Partial MaxSAT Problems Based on Stochastic Local Search.
SIGARCH Comput. Archit. News, 2016

New local search methods for partial MaxSAT.
Artif. Intell., 2016

Fast Solving Maximum Weight Clique Problem in Massive Graphs.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A novel approach to parameterized verification of cache coherence protocols.
Proceedings of the 34th IEEE International Conference on Computer Design, 2016

Two Efficient Local Search Algorithms for Maximum Weight Clique Problem.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
An I/O Efficient Model Checking Algorithm for Large-Scale Systems.
IEEE Trans. Very Large Scale Integr. Syst., 2015

An I/O Efficient Approach for Detecting All Accepting Cycles.
IEEE Trans. Software Eng., 2015

Clause States Based Configuration Checking in Local Search for Satisfiability.
IEEE Trans. Cybern., 2015

CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability.
IEEE Trans. Computers, 2015

An effective variable selection heuristic in SLS for weighted Max-2-SAT.
J. Heuristics, 2015

Improving WalkSAT By Effective Tie-Breaking and Efficient Implementation.
Comput. J., 2015

CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T).
Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering, 2015

Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Two Weighting Local Search for Minimum Vertex Cover.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Scoring Functions Based on Second Level Score for k-SAT with Long Clauses.
J. Artif. Intell. Res., 2014

More efficient two-mode stochastic local search for random 3-satisfiability.
Appl. Intell., 2014

Double Configuration Checking in Stochastic Local Search for Satisfiability.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Tailoring Local Search for Partial MaxSAT.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover.
J. Artif. Intell. Res., 2013

A clique-superposition model for social networks.
Sci. China Inf. Sci., 2013

Local search for Boolean Satisfiability with configuration checking and subscore.
Artif. Intell., 2013

Comprehensive Score: Towards Efficient Local Search for SAT with Long Clauses.
Proceedings of the IJCAI 2013, 2013

Focused Random Walk with Configuration Checking and Break Minimum for Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Improving WalkSAT for Random k-Satisfiability Problem with k > 3.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Improving Local Search for Random 3-SAT Using Quantitative Configuration Checking.
Proceedings of the ECAI 2012, 2012

Two New Local Search Strategies for Minimum Vertex Cover.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Configuration Checking with Aspiration in Local Search for SAT.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Local search with edge weighting and configuration checking heuristics for minimum vertex cover.
Artif. Intell., 2011

Local Search with Configuration Checking for SAT.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010
EWLS: A New Local Search for Minimum Vertex Cover.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010


  Loading...