Liming Zhang

Orcid: 0000-0001-8263-4194

Affiliations:

Jilin University, Key Laboratory of Symbolic Computation and Knowledge Engineering, Changchun, China

According to our database¹, Liming Zhang authored at least 24 papers between 2011 and 2024.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

DSLS: a simple and efficient local search algorithm for the maximum bisection problem.

[BibT_eX]

[DOI]

J. Heuristics, April, 2024

DeciLS-PBO: an effective local search method for pseudo-Boolean optimization.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., April, 2024

2023

DiagDO: an efficient model based diagnosis approach with multiple observations.

[BibT_eX]

[DOI]

Frontiers Comput. Sci., December, 2023

ILSGVCP: An improved local search algorithm for generalized vertex cover problem.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., November, 2023

DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplans.

[BibT_eX]

[DOI]

J. Supercomput., September, 2023

Combinatorial optimization and local search: A case study of the discount knapsack problem.

[BibT_eX]

[DOI]

Comput. Electr. Eng., January, 2023

An efficient power set mapping space blocking algorithm for sensor selection in uncertain systems with quantified diagnosability requirements.

[BibT_eX]

[DOI]

Appl. Intell., 2023

2022

Two efficient local search algorithms for the vertex bisection minimization problem.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Model-based diagnosis with improved implicit hitting set dualization.

[BibT_eX]

[DOI]

Appl. Intell., 2022

Evolutionary many-objective satisfiability solver for configuring software product lines.

[BibT_eX]

[DOI]

Appl. Intell., 2022

Two Compacted Models for Efficient Model-Based Diagnosis.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

TreeMerge: Efficient Generation of Minimal Hitting-Sets for Conflict Sets in Tree Structure for Model-Based Fault Diagnosis.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2021

Core-guided method for constraint-based multi-objective combinatorial optimization.

[BibT_eX]

[DOI]

Appl. Intell., 2021

2018

A restart local search algorithm for solving maximum set k-covering problem.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2018

Efficient zonal diagnosis with maximum satisfiability.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2018

Computing all minimal hitting sets by subset recombination.

[BibT_eX]

[DOI]

Xiangfu Zhao

Dantong Ouyang

Liming Zhang

Appl. Intell., 2018

A novel approach for improving quality of health state with difference degree in circuit diagnosis.

[BibT_eX]

[DOI]

Meng Liu

Dantong Ouyang

Liming Zhang

Appl. Intell., 2018

A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree.

[BibT_eX]

[DOI]

IEEE Access, 2018

An Efficient Approach for Computing Conflict Sets Combining Failure Probability with SAT.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 2018

2017

A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>-covering problem.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2017

A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2017

2015

Improved Algorithm of Unsatisfiability-based Maximum Satisfiability.

[BibT_eX]

[DOI]

Yiyuan Wang

Dantong Ouyang

Liming Zhang

Proceedings of the 1st International Workshop on Semantic Technologies (IWOST), 2015

2012

Reasoning on partially-ordered observations in online diagnosis of DESs.

[BibT_eX]

[DOI]

AI Commun., 2012

2011

Dynamic theorem proving algorithm for consistency-based diagnosis.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2011

Liming Zhang

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...