40 citations · 40 across the 2 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2020
NLocalSAT: Boosting Local Search with Solution Prediction
Wenjie Zhang, Zeyu Sun, Qihao Zhu +4
The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search…
cs.AI2019
Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem
Peilin Chen, Hai Wan, Shaowei Cai +2
The Maximum k-plex Problem is an important combinatorial optimization problem with increasingly wide applications. Due to its exponential time complexity, many heuristic methods ha…
cs.AI2017★ 40 cited
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
Yiyuan Wang, Shaowei Cai, Minghao Yin
The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new l…