Chuan Luo

Latest

Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis
Optimizing local search-based partial MaxSAT solving via initial assignment prediction
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem
CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays
Generating Pairwise Covering Arrays for Highly Configurable Software Systems
NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques
SamplingCA: effective and efficient sampling-based pairwise testing for highly configurable software systems. ESEC/SIGSOFT FSE 2022: 1185-1197
AutoCCAG: An Automated Approach to Constrained Covering Array Generation ICSE 2021: 201-212
Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems
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 Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper). CP 2021: 5:1-5:10
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
PbO-CCSAT: Boosting Local Search for Satisfiability Using Programming by Optimisation PPSN (1) 2020: 373-389
Two-goal Local Search and Inference Rules for Minimum Dominating Set 2020: 1467-1473
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 more efficient meta-heuristic algorithms for combinatorial test generation ESEC/SIGSOFT FSE 2019: 212-222
A Reduction based Method for Coloring Very Large Graphs
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
New local search methods for partial MaxSAT
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
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
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