An improved genetic algorithm for solving 3-SAT problems based on effective restart and greedy strategy. - Huimin Fu 002; Yang Xu 001; Guanfeng Wu; Xinran Ning (ISKE, 2017)

An Improved Adaptive Genetic Algorithm for Solving 3-SAT Problems Based on Effective Restart and Greedy Strategy. - Huimin Fu 002; Yang Xu 001; Guanfeng Wu; Hairui Jia; Wuyang Zhang; Rong Hu (Int. J. Comput. Intell. Syst., 2018)

Set-Blocked Clause and Extended Set-Blocked Clause in First-Order Logic. - Xinran Ning; Yang Xu 001; Guanfeng Wu; Huimin Fu 002 (Symmetry, 2018)

Focused random walk with probability distribution for SAT with long clauses. - Huimin Fu 002; Jun Liu 001; Yang Xu 001 (Appl. Intell., 2020)

Improving probability selecting based weights for Satisfiability Problem. - Huimin Fu 002; Yang Xu 001; Jun Liu 001; Guanfeng Wu; Geoff Sutcliffe (CoRR, 2020)

Improving WalkSAT for Random 3-SAT Problems. - Huimin Fu 002; Yang Xu 001; Shuwei Chen 001; Jun Liu 001 (J. Univers. Comput. Sci., 2020)

More efficient stochastic local search for satisfiability. - Huimin Fu 002; Guanfeng Wu; Jun Liu 001; Yang Xu 001 (Appl. Intell., 2021)

Improving stochastic local search for uniform k-SAT by generating appropriate initial assignment. - Huimin Fu 002; Wuyang Zhang; Guanfeng Wu; Yang Xu 001; Jun Liu 001 (Comput. Intell., 2021)

Emphasis on the flipping variable: Towards effective local search for hard random satisfiability. - Huimin Fu 002; Yang Xu 001; Guanfeng Wu; Jun Liu 001; Shuwei Chen 001; Xingxing He (Inf. Sci., 2021)

Improving probability selection based weights for satisfiability problems. - Huimin Fu 002; Jun Liu 001; Guanfeng Wu; Yang Xu 001; Geoff Sutcliffe (Knowl. Based Syst., 2022)

Improving two-mode algorithm via probabilistic selection for solving satisfiability problem. - Huimin Fu 002; Shaowei Cai 001; Guanfeng Wu; Jun Liu 001; Xin Yang; Yang Xu 001 (Inf. Sci., 2024)