default search action
Qing-Hua Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Qing-Hua Li, Jun-Qing Li, Qingke Zhang, Peng Duan, Tao Meng:
An improved whale optimisation algorithm for distributed assembly flow shop with crane transportation. Int. J. Autom. Control. 15(6): 710-743 (2021)
2010 – 2019
- 2019
- [j6]Qing-Hua Li, Han-Liang Huang, Zhen-Yu Xiu:
Degrees of special mappings in the theory of L-convex spaces. J. Intell. Fuzzy Syst. 37(2): 2265-2274 (2019) - [j5]Qing-Hua Li, Hong-Yan Li:
Applications of fuzzy inclusion orders between L-subsets in fuzzy topological structures. J. Intell. Fuzzy Syst. 37(2): 2587-2596 (2019) - [j4]Bing Wang, Qing-Hua Li:
Galois correspondences in soft L-topological spaces. J. Intell. Fuzzy Syst. 37(4): 5097-5103 (2019) - 2013
- [c11]Zi-Yang Qi, Qing-Hua Li, Guo-Xing Yi, Yang-Guang Xie, Hong-Tao Dang:
Online fault detection of HRG based on an improved support vector machine. ICMLC 2013: 316-319 - [c10]Qing-Hua Li, Wei-Nan Xie, Tao Liu, Zi-Yang Qi:
Reference governor for second order constrained linear systems with small input time delays. ICMLC 2013: 1022-1027 - 2012
- [c9]Hai-Yan Kang, Qing-Hua Li, Xiao-Jiao Yuan, Jun-Ling Ren:
Similarity calculation of fusion sentence surface information and the syntax structure. ICMLC 2012: 773-778 - 2011
- [j3]Qing-Hua Li, Shen-Shen Chen, Guang-Xiao Kou:
Transient heat conduction analysis using the MLPG method and modified precise time step integration method. J. Comput. Phys. 230(7): 2736-2750 (2011)
2000 – 2009
- 2006
- [j2]Shengyi Jiang, Xiaoyu Song, Hui Wang, Jian-Jun Han, Qing-Hua Li:
A clustering-based method for unsupervised intrusion detections. Pattern Recognit. Lett. 27(7): 802-810 (2006) - 2005
- [c8]Jian-Jun Han, Qing-Hua Li:
Dynamic Power-Aware Scheduling Algorithms for Real-Time Task Sets with Fault-Tolerance in Parallel and Distributed Computing Environment. IPDPS 2005 - 2004
- [j1]Kenli Li, Renfa Li, Qing-Hua Li:
Optimal Parallel Algorithm for the Knapsack Problem Without Memory Conflicts. J. Comput. Sci. Technol. 19(6): 760-768 (2004) - [c7]Jian-Jun Han, Qing-Hua Li:
A Transaction Scheduling Algorithm with Temporal Constraints in Real-time Database Systems. CIT 2004: 940-945 - [c6]Hui Wang, Qing-Hua Li, Huanyu Xiong, Shengyi Jiang:
Mining Maximal Frequent Itemsets for Intrusion Detection. GCC Workshops 2004: 422-429 - [c5]Shengyi Jiang, Qing-Hua Li, Hui Wang:
A Gravity-Based Intrusion Detection Method. GCC Workshops 2004: 522-529 - [c4]Feng Zhao, Qing-Hua Li, Yan-Bin Zhao:
Real Time Approaches for Time-Series Mining-Based IDS. GCC 2004: 879-882 - [c3]Hong-jun Zhang, Qing-Hua Li, Wei Zhang:
Commitment in Cooperative Problem Solving. GCC 2004: 993-996 - [c2]Jian-Jun Han, Qing-Hua Li:
A Novel Static Task Scheduling Algorithm in Distributed Computing Environments. IPDPS 2004 - 2003
- [c1]Jian-Jun Han, Qing-Hua Li:
A New Task Scheduling Algorithm in Distributed Computing Environments. GCC (2) 2003: 141-144
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-07-25 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint