Liming Zhang 0005 - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2024

DeciLS-PBO: an effective local search method for pseudo-Boolean optimizationLuyu Jiang, Dantong Ouyang, Qi Zhang, Liming Zhang 0005. fcsc, 18(2):182326, April 2024. [doi]

DSLS: a simple and efficient local search algorithm for the maximum bisection problemXinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang 0005. heuristics, 30(1):43-65, April 2024. [doi]

2023

DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplansLuyu Jiang, Dantong Ouyang, Huisi Zhou, Naiyu Tian, Liming Zhang 0005. tjs, 79(14):15496-15534, September 2023. [doi]

An efficient power set mapping space blocking algorithm for sensor selection in uncertain systems with quantified diagnosability requirementsRui Sun, Dantong Ouyang, Xinliang Tian, Liming Zhang 0005. apin, 53(3):2879-2896, 2023. [doi]

ILSGVCP: An improved local search algorithm for generalized vertex cover problemRan Tai, Dantong Ouyang, Ruizhi Li, Liming Zhang 0005. jors, 74(11):2382-2390, November 2023. [doi]

Combinatorial optimization and local search: A case study of the discount knapsack problemXinliang Tian, Dantong Ouyang, Yiyuan Wang, Huisi Zhou, Luyu Jiang, Liming Zhang 0005. cee, 105:108551, January 2023. [doi]

DiagDO: an efficient model based diagnosis approach with multiple observationsHuisi Zhou, Dantong Ouyang, Xinliang Tian, Liming Zhang 0005. fcsc, 17(6):176407, December 2023. [doi]

2022

2021

TreeMerge: Efficient Generation of Minimal Hitting-Sets for Conflict Sets in Tree Structure for Model-Based Fault DiagnosisXiangfu Zhao, Xiangrong Tong, Dantong Ouyang, Liming Zhang 0005, Yanzhi Hou. tr, 70(4):1596-1610, 2021. [doi]

2018

Efficient zonal diagnosis with maximum satisfiabilityMeng Liu, Dantong Ouyang, Shaowei Cai, Liming Zhang 0005. chinaf, 61(11), 2018. [doi]

A novel approach for improving quality of health state with difference degree in circuit diagnosisMeng Liu, Dantong Ouyang, Liming Zhang 0005. apin, 48(11):4371-4381, 2018. [doi]

An Efficient Approach for Computing Conflict Sets Combining Failure Probability with SATYa Tao, Dantong Ouyang, Meng Liu, Liming Zhang 0005. ksem 2018: 48-58 [doi]

A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting TreeNaiyu Tian, Dantong Ouyang, Fengyu Jia, Meng Liu, Liming Zhang 0005. access, 6:41042-41049, 2018. [doi]

A restart local search algorithm for solving maximum set k-covering problemYiyuan Wang, Dantong Ouyang, Minghao Yin, Liming Zhang 0005, Yonggang Zhang. nca, 29(10):755-765, 2018. [doi]

Computing all minimal hitting sets by subset recombinationXiangfu Zhao, Dantong Ouyang, Liming Zhang 0005. apin, 48(2):257-270, 2018. [doi]

2017

A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversityYiyuan Wang, Dantong Ouyang, Liming Zhang 0005, Minghao Yin. chinaf, 60(6):62103, 2017. [doi]

Sign in or sign up to see more results.

runs on WebDSL