default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingfa Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Jingfa Liu, Kewang Zhang
, Xueming Yan, Qiansheng Zhang:
A configuration space evolutionary algorithm with local minimizer for weighted circles packing problem. Expert Syst. Appl. 238(Part B): 121768 (2024)- 2023
- [j28]Qiansheng Zhang, Jingfa Liu, Haixiang Yao:
An option pricing model with adaptive interval-valued fuzzy numbers. Int. J. Comput. Sci. Math. 17(4): 371-381 (2023) - [j27]Jingfa Liu, Zhen Wang, Guo Zhong, Zhihe Yang:
A new focused crawler using an improved tabu search algorithm incorporating ontology and host information. Frontiers Inf. Technol. Electron. Eng. 24(6): 859-875 (2023) - 2022
- [j26]Jingfa Liu, Yi Dong, Zhaoxia Liu, Duanbing Chen:
Applying ontology learning and multi-objective ant colony optimization method for focused crawling to meteorological disasters domain knowledge. Expert Syst. Appl. 198: 116741 (2022) - [j25]Xuanlong Ma, Xueming Yan, Jingfa Liu, Guo Zhong:
Simultaneous multi-graph learning and clustering for multiview data. Inf. Sci. 593: 472-487 (2022) - [j24]Jingfa Liu, Fan Li, Ruoyao Ding, Ziang Liu:
Focused crawling strategies based on ontologies and simulated annealing methods for rainstorm disaster domain knowledge. Frontiers Inf. Technol. Electron. Eng. 23(8): 1189-1204 (2022) - [j23]Jingfa Liu, Xin Li, Qiansheng Zhang, Guo Zhong:
A novel focused crawler combining Web space evolution and domain ontology. Knowl. Based Syst. 243: 108495 (2022) - 2020
- [j22]Jingfa Liu, Siyu Liu, Zhaoxia Liu, Bi Li:
Configuration space evolutionary algorithm for multi-objective unequal-area facility layout problems with flexible bays. Appl. Soft Comput. 89: 106052 (2020) - [j21]Jingfa Liu, Jun Liu, Xueming Yan, Bitao Peng:
A heuristic algorithm combining Pareto optimization and niche technology for multi-objective unequal area facility layout problem. Eng. Appl. Artif. Intell. 89: 103453 (2020) - [c7]Jingfa Liu, Wei Zhang, Zhihe Yang, Ziang Liu:
Focused Crawler Strategy Based on Improved Energy Landscape Paving Algorithm. FSDM 2020: 536-545
2010 – 2019
- 2019
- [j20]Jingfa Liu, Jun Liu:
Applying multi-objective ant colony optimization algorithm for solving the unequal area facility layout problems. Appl. Soft Comput. 74: 167-189 (2019) - [j19]Jingfa Liu, Fan Li, Shengyi Jiang:
基于综合优先度和主机信息的暴雨灾害主题退火爬虫算法 (Focused Annealing Crawler Algorithm for Rainstorm Disasters Based on Comprehensive Priority and Host Information). 计算机科学 46(2): 215-222 (2019) - 2018
- [j18]Kun He, Hui Ye, Zhengli Wang, Jingfa Liu:
An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container. Comput. Oper. Res. 92: 26-36 (2018) - [j17]Jingfa Liu, Huiyun Zhang, Kun He, Shengyi Jiang:
Multi-objective particle swarm optimization algorithm based on objective space division for the unequal-area facility layout problem. Expert Syst. Appl. 102: 179-192 (2018) - [j16]Binping Zhao, Yu Xue, Bin Xu, Tinghuai Ma, Jingfa Liu:
Multi-objective classification based on NSGA-II. Int. J. Comput. Sci. Math. 9(6): 539-546 (2018) - 2017
- [j15]Jingfa Liu, Jian Li, Zhipeng Lü, Yu Xue:
A quasi-human strategy-based improved basin filling algorithm for the orthogonal rectangular packing problem with mass balance constraint. Comput. Ind. Eng. 107: 196-210 (2017) - [j14]Jingfa Liu, Dawen Wang, Kun He, Yu Xue:
Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem. Eur. J. Oper. Res. 262(3): 1052-1063 (2017) - 2016
- [j13]Jingfa Liu, Kewang Zhang, Yonglei Yao, Yu Xue, Tinzhao Guan:
A heuristic quasi-physical algorithm with coarse and fine adjustment for multi-objective weighted circles packing problem. Comput. Ind. Eng. 101: 416-426 (2016) - [j12]Jingfa Liu, Juan Huang, Yucong Jiang, Wenjie Liu, Liang Hao:
基于Wang-Landau抽样的带静不平衡约束的简化卫星舱布局方法 (Packing Method Based on Wang-Landau Sampling for Simplified Satellite Module with Static Non-equilibrium Constraints). 计算机科学 43(12): 287-292 (2016) - [j11]Jingfa Liu, Liang Hao, Gang Li, Yu Xue, Zhaoxia Liu, Juan Huang:
Multi-objective layout optimization of a satellite module using the Wang-Landau sampling method with local search. Frontiers Inf. Technol. Electron. Eng. 17(6): 527-542 (2016) - [j10]Jingfa Liu, Juan Huang, Gang Li, Wenjie Liu, Tingzhao Guan, Liang Hao:
A new energy landscape paving heuristic for satellite module layouts. Frontiers Inf. Technol. Electron. Eng. 17(10): 1031-1043 (2016) - 2014
- [j9]Yonglei Yao, Jingfa Liu, Neal N. Xiong:
Privacy-Preserving Data Aggregation in Two-Tiered Wireless Sensor Networks with Mobile Nodes. Sensors 14(11): 21174-21194 (2014) - 2013
- [j8]Jingfa Liu, Yuanyuan Sun, Gang Li, Beibei Song, Weibo Huang:
Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins. Comput. Biol. Chem. 47: 142-148 (2013) - [j7]Yonglei Yao, Naixue Xiong, Jong Hyuk Park, Li Ma, Jingfa Liu:
Privacy-preserving max/min query in two-tiered wireless sensor networks. Comput. Math. Appl. 65(9): 1318-1325 (2013) - 2012
- [j6]Jingfa Liu, Gang Li, Jun Yu, Yonglei Yao:
Heuristic energy landscape paving for protein folding problem in the three-dimensional HP lattice model. Comput. Biol. Chem. 38: 17-26 (2012) - 2011
- [j5]Jingfa Liu, Gang Li, Huantong Geng:
A new heuristic algorithm for the circular packing problem with equilibrium constraints. Sci. China Inf. Sci. 54(8): 1572-1584 (2011) - [c6]Wenjie Liu, Jingfa Liu, Hao Xiao, Tinghuai Ma, Yu Zheng:
Multiparty Simultaneous Quantum Secure Direct Communication Based on GHZ States and Mutual Authentication. ISNN (3) 2011: 209-218 - 2010
- [j4]Jingfa Liu, Gang Li, Duanbing Chen, Wenjie Liu, Yali Wang:
Two-dimensional equilibrium constraint layout using simulated annealing. Comput. Ind. Eng. 59(4): 530-536 (2010) - [j3]Jingfa Liu, Gang Li:
Basin filling algorithm for the circular packing problem with equilibrium behavioral constraints. Sci. China Inf. Sci. 53(5): 885-895 (2010) - [j2]Duanbing Chen, Jingfa Liu, Yan Fu, Mingsheng Shang:
An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem. Comput. Oper. Res. 37(6): 1068-1074 (2010)
2000 – 2009
- 2009
- [j1]Jingfa Liu, Shengjun Xue, Zhaoxia Liu, Danhua Xu:
An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Comput. Ind. Eng. 57(3): 1144-1149 (2009) - [c5]Jingfa Liu, Yali Wang, Jinji Pan:
Efficiently Packing Circles into a Larger Containing Circle. HPCA (China) 2009: 250-256 - [c4]Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, Guocheng Zhou:
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems. COCOA 2009: 135-144 - [c3]Yu Zheng, Jingfa Liu, Wue-hua Geng, Jing-yu Yang:
Quantum-Inspired Genetic Evolutionary Algorithm for Course Timetabling. WGEC 2009: 750-753 - [c2]Jingfa Liu, Yu Zheng, Wenjie Liu:
A Heuristic Simulated Annealing Algorithm for the Circular Packing Problem. WGEC 2009: 802-805 - 2008
- [c1]Wenjie Liu, Hanwu Chen, Tinghuai Ma, Jingfa Liu:
Efficient Deterministic Secure Quantum Communication with Cluster State. PACIIA (1) 2008: 722-726
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 2025-01-20 22:55 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:
