default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiming Zhang 0005
Person information
- affiliation: Jilin University, Key Laboratory of Symbolic Computation and Knowledge Engineering, Changchun, China
Other persons with the same name
- Liming Zhang — disambiguation page
- Liming Zhang 0001 — Fudan University, School of Information Science and Technology, Research Center of Smart Networks and Systems, Shanghai, China (and 1 more)
- Liming Zhang 0002
![[0000-0002-2664-8193]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2664-8193")
— University of Macau, Faculty of Science and Technology, Macau (and 1 more) - Liming Zhang 0003 — Liaocheng University
- Liming Zhang 0004 — Sun Yat-Sen University, Department of Computer Science, Guangzhou, China
- Liming Zhang 0006 — Shandong University, School of Computer Science and Technology, Jinan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j21]Luyu Jiang, Dantong Ouyang, Qi Zhang, Liming Zhang:
DeciLS-PBO: an effective local search method for pseudo-Boolean optimization. Frontiers Comput. Sci. 18(2): 182326 (2024)- [j20]Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang:
DSLS: a simple and efficient local search algorithm for the maximum bisection problem. J. Heuristics 30(1-2): 43-65 (2024) - 2023
- [j19]Rui Sun, Dantong Ouyang, Xinliang Tian, Liming Zhang:
An efficient power set mapping space blocking algorithm for sensor selection in uncertain systems with quantified diagnosability requirements. Appl. Intell. 53(3): 2879-2896 (2023) - [j18]Xinliang Tian, Dantong Ouyang, Yiyuan Wang, Huisi Zhou, Luyu Jiang, Liming Zhang:
Combinatorial optimization and local search: A case study of the discount knapsack problem. Comput. Electr. Eng. 105: 108551 (2023) - [j17]Huisi Zhou, Dantong Ouyang, Xinliang Tian, Liming Zhang:
DiagDO: an efficient model based diagnosis approach with multiple observations. Frontiers Comput. Sci. 17(6): 176407 (2023) - [j16]Ran Tai, Dantong Ouyang, Ruizhi Li, Liming Zhang:
ILSGVCP: An improved local search algorithm for generalized vertex cover problem. J. Oper. Res. Soc. 74(11): 2382-2390 (2023) - [j15]Luyu Jiang, Dantong Ouyang, Huisi Zhou, Naiyu Tian, Liming Zhang:
DPAHMA: a novel dual-population adaptive hybrid memetic algorithm for non-slicing VLSI floorplans. J. Supercomput. 79(14): 15496-15534 (2023) - 2022
- [j14]Huisi Zhou, Dantong Ouyang, Liming Zhang, Naiyu Tian:
Model-based diagnosis with improved implicit hitting set dualization. Appl. Intell. 52(2): 2111-2118 (2022) - [j13]Yimou Hou, Dantong Ouyang, Xinliang Tian, Liming Zhang:
Evolutionary many-objective satisfiability solver for configuring software product lines. Appl. Intell. 52(9): 10650-10673 (2022) - [j12]Xinliang Tian, Dantong Ouyang, Rui Sun, Huisi Zhou, Liming Zhang:
Two efficient local search algorithms for the vertex bisection minimization problem. Inf. Sci. 609: 153-171 (2022) - 2021
- [j11]Naiyu Tian, Dantong Ouyang, Yiyuan Wang, Yimou Hou, Liming Zhang:
Core-guided method for constraint-based multi-objective combinatorial optimization. Appl. Intell. 51(6): 3865-3879 (2021) - [j10]Xiangfu Zhao, Xiangrong Tong, Dantong Ouyang, Liming Zhang, Yanzhi Hou:
TreeMerge: Efficient Generation of Minimal Hitting-Sets for Conflict Sets in Tree Structure for Model-Based Fault Diagnosis. IEEE Trans. Reliab. 70(4): 1596-1610 (2021) - 2018
- [j9]Naiyu Tian, Dantong Ouyang, Fengyu Jia, Meng Liu, Liming Zhang:
A Parallel Extension Rule-Based Algorithm for #SAT Problem Using Model-Counting Tree. IEEE Access 6: 41042-41049 (2018) - [j8]Xiangfu Zhao, Dantong Ouyang, Liming Zhang:
Computing all minimal hitting sets by subset recombination. Appl. Intell. 48(2): 257-270 (2018) - [j7]Meng Liu, Dantong Ouyang, Liming Zhang:
A novel approach for improving quality of health state with difference degree in circuit diagnosis. Appl. Intell. 48(11): 4371-4381 (2018) - [j6]Meng Liu, Dantong Ouyang, Shaowei Cai, Liming Zhang:
Efficient zonal diagnosis with maximum satisfiability. Sci. China Inf. Sci. 61(11): 112101:1-112101:14 (2018) - [j5]Yiyuan Wang, Dantong Ouyang, Minghao Yin, Liming Zhang, Yonggang Zhang:
A restart local search algorithm for solving maximum set k-covering problem. Neural Comput. Appl. 29(10): 755-765 (2018) - 2017
- [j4]Yiyuan Wang, Dantong Ouyang, Liming Zhang, Minghao Yin:
A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity. Sci. China Inf. Sci. 60(6): 62103 (2017) - [j3]Yiyuan Wang, Minghao Yin, Dantong Ouyang, Liming Zhang:
A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. Int. Trans. Oper. Res. 24(6): 1463-1485 (2017) - 2012
- [j2]Xiangfu Zhao, Dantong Ouyang, Liming Zhang, Xiaoyu Wang, Yuchang Mo:
Reasoning on partially-ordered observations in online diagnosis of DESs. AI Commun. 25(4): 285-294 (2012) - 2011
- [j1]Liming Zhang, Hai-Lin Zeng, Fang Yang, Dantong Ouyang:
Dynamic theorem proving algorithm for consistency-based diagnosis. Expert Syst. Appl. 38(6): 7511-7516 (2011)
Conference and Workshop Papers
- 2022
- [c3]Huisi Zhou, Dantong Ouyang, Xiangfu Zhao, Liming Zhang:
Two Compacted Models for Efficient Model-Based Diagnosis. AAAI 2022: 3885-3893 - 2018
- [c2]Ya Tao, Dantong Ouyang, Meng Liu, Liming Zhang:
An Efficient Approach for Computing Conflict Sets Combining Failure Probability with SAT. KSEM (2) 2018: 48-58 - 2015
- [c1]Yiyuan Wang, Dantong Ouyang, Liming Zhang:
Improved Algorithm of Unsatisfiability-based Maximum Satisfiability. IWOST-1 2015: 93-103
Informal and Other Publications
- 2023
- [i1]Luyu Jiang, Dantong Ouyang, Qi Zhang, Liming Zhang:
DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization. CoRR abs/2301.12251 (2023)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
