Chuan Luo

Orcid: 0000-0001-5028-1064

Affiliations:
  • Beihang University, Beijing, China
  • Peking University, Beijing, China (former)
  • Chinese Academy of Sciences, Institute of Computing Technology, Beijing, China (former)
  • Leiden University, Leiden, The Netherlands (former)


According to our database1, Chuan Luo authored at least 77 papers between 2012 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
MPSketch: Message Passing Networks via Randomized Hashing for Efficient Attributed Network Embedding.
IEEE Trans. Cybern., May, 2024

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

Automated Test Suite Generation for Software Product Lines Based on Quality-Diversity Optimization.
ACM Trans. Softw. Eng. Methodol., February, 2024

An Advanced Reinforcement Learning Framework for Online Scheduling of Deferrable Workloads in Cloud Computing.
CoRR, 2024

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis.
CoRR, 2024

Contrastive Learning with Negative Sampling Correction.
CoRR, 2024

Scene-wise Adaptive Network for Dynamic Cold-start Scenes Optimization in CTR Prediction.
Proceedings of the 18th ACM Conference on Recommender Systems, 2024

Beyond Pairwise Testing: Advancing 3-wise Combinatorial Interaction Testing for Highly Configurable Systems.
Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis, 2024

2023
Improving the performance of stochastic local search for maximum vertex weight clique problem using programming by optimization.
Expert Syst. Appl., 2023

Feature Decomposition for Reducing Negative Transfer: A Novel Multi-task Learning Method for Recommender System.
CoRR, 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

SCHash: Speedy Simplicial Complex Neural Networks via Randomized Hashing.
Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2023

Did We Miss Something Important? Studying and Exploring Variable-Aware Log Abstraction.
Proceedings of the 45th IEEE/ACM International Conference on Software Engineering, 2023

HiNet: Novel Multi-Scenario & Multi-Task Learning with Hierarchical Information Extraction.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

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

Feature Decomposition for Reducing Negative Transfer: A Novel Multi-Task Learning Method for Recommender System (Student Abstract).
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

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

2022
Distributed Evolution Strategies for Black-Box Stochastic Optimization.
IEEE Trans. Parallel Distributed Syst., 2022

Sparkle: Toward Accessible Meta-Algorithmics for Improving the State of the Art in Solving Challenging Problems.
IEEE Trans. Evol. Comput., 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

NENYA: Cascade Reinforcement Learning for Cost-Aware Failure Mitigation at Microsoft 365.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Multi-task Hierarchical Classification for Disk Failure Prediction in Online Service Systems.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

T-SMOTE: Temporal-oriented Synthetic Minority Oversampling Technique for Imbalanced Time Series Classification.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Search-based Diverse Sampling from Real-world Software Product Lines.
Proceedings of the 44th IEEE/ACM 44th International Conference on Software Engineering, 2022

Automatic Loss Function Search for Predict-Then-Optimize Problems with Strong Ranking Property.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
A Surrogate Objective Framework for Prediction+Optimization with Soft Constraints.
CoRR, 2021

Hashing-Accelerated Graph Neural Networks for Link Prediction.
Proceedings of the WWW '21: The Web Conference 2021, 2021

NTAM: Neighborhood-Temporal Attention Model for Disk Failure Prediction in Cloud Platforms.
Proceedings of the WWW '21: The Web Conference 2021, 2021

Intelligent container reallocation at Microsoft 365.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

LS-sampling: an effective local search based sampling approach for achieving high t-wise coverage.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Effective low capacity status prediction for cloud systems.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

RLNF: Reinforcement Learning based Noise Filtering for Click-Through Rate Prediction.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

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

A Surrogate Objective Framework for Prediction+Programming with Soft Constraints.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Runtime Analysis of Typical Decomposition Approaches in MOEA/D Framework for Many-objective Optimization Problems.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Predictive Job Scheduling under Uncertain Constraints in Cloud Computing.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 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

CARE: Infusing Causal Aware Thinking to Root Cause Analysis in Cloud System.
Proceedings of the HAOC '21: Proceedings of the 1st Workshop on High Availability and Observability of Cloud Systems, 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

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

Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization.
CoRR, 2020

Efficient customer incident triage via linking with system incidents.
Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 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

Intelligent Virtual Machine Provisioning in Cloud Computing.
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

2019
Empirical investigation of stochastic local search for maximum satisfiability.
Frontiers Comput. Sci., 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

Neural Feature Search: A Neural Architecture for Automated Feature Engineering.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

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

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

Hard Neighboring Variables Based Configuration Checking in Stochastic Local Search for Weighted Partial Maximum Satisfiability.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

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

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

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

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

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

FWLS: A Local Search for Graph Coloring.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 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


  Loading...