default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhaocai Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Xuefei Cui, Zhaocai Wang
, Nannan Xu, Junhao Wu, Zhiyuan Yao:
A secondary modal decomposition ensemble deep learning model for groundwater level prediction using multi-data. Environ. Model. Softw. 175: 105969 (2024)- [j17]Zhaocai Wang, Nannan Xu, Xiaoguang Bao, Junhao Wu, Xuefei Cui:
Spatio-temporal deep learning model for accurate streamflow prediction with multi-source data fusion. Environ. Model. Softw. 178: 106091 (2024) - [j16]Zhaocai Wang, Haifeng Zhao, Xiaoguang Bao, Tunhua Wu:
Multi-objective optimal allocation of water resources based on improved marine predator algorithm and entropy weighting method. Earth Sci. Informatics 17(2): 1483-1499 (2024) - 2023
- [j15]Rui Tan, Yuan Hu, Zhaocai Wang:
A multi-source data-driven model of lake water level based on variational modal decomposition and external factors with optimized bi-directional long short-term memory neural network. Environ. Model. Softw. 167: 105766 (2023) - [j14]Zhaocai Wang, Kun Liang, Xiaoguang Bao, Tunhua Wu:
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm. Quantum Inf. Process. 22(7): 271 (2023) - 2022
- [j13]Zhaocai Wang, Anjun Deng, Dangwei Wang, Tunhua Wu:
A parallel algorithm to solve the multiple travelling salesmen problem based on molecular computing model. Int. J. Bio Inspired Comput. 20(3): 160-171 (2022) - [j12]Xian Wu, Zhaocai Wang:
Multi-objective optimal allocation of regional water resources based on slime mould algorithm. J. Supercomput. 78(16): 18288-18317 (2022) - 2021
- [j11]Zhaocai Wang, Xiaoguang Bao, Tunhua Wu:
A Parallel Bioinspired Algorithm for Chinese Postman Problem Based on Molecular Computing. Comput. Intell. Neurosci. 2021: 8814947:1-8814947:13 (2021) - [j10]Xiaomin Ren, Xiaoming Wang, Zhaocai Wang, Tunhua Wu:
Parallel DNA Algorithms of Generalized Traveling Salesman Problem-Based Bioinspired Computing Model. Int. J. Comput. Intell. Syst. 14(1): 228-237 (2021) - [j9]Zhaocai Wang, Dangwei Wang, Xiaoguang Bao, Tunhua Wu:
A parallel biological computing algorithm to solve the vertex coloring problem with polynomial time complexity. J. Intell. Fuzzy Syst. 40(3): 3957-3967 (2021)
2010 – 2019
- 2019
- [j8]Zhaocai Wang, Xiaomin Ren, Zuwen Ji, Wei Huang, Tunhua Wu:
A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model. Biosyst. 184 (2019) - 2017
- [j7]Zhaocai Wang, Zuwen Ji, Xiaoming Wang, Tunhua Wu, Wei Huang:
A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model. Biosyst. 162: 59-65 (2017) - [j6]Zuwen Ji, Zhaocai Wang, Tunhua Wu, Wei Huang:
Solving the 0-1 knapsack problem based on a parallel intelligent molecular computing model system. J. Intell. Fuzzy Syst. 33(5): 2719-2726 (2017) - 2015
- [j5]Zhaocai Wang, Dongmei Huang, Jian Tan, Taigang Liu, Kai Zhao, Lei Li:
A parallel algorithm for solving the n-queens problem based on inspired computational model. Biosyst. 131: 22-29 (2015) - 2014
- [j4]Zhaocai Wang, Jian Tan, Dongmei Huang, Yingchao Ren, Zuwen Ji:
A biological algorithm to solve the assignment problem based on DNA molecules computation. Appl. Math. Comput. 244: 183-190 (2014) - 2013
- [j3]Zhaocai Wang, Dongmei Huang, Huajun Meng, Chengpei Tang:
A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation. Biosyst. 114(1): 1-7 (2013) - 2012
- [j2]Zhaocai Wang, Yiming Zhang, Weihua Zhou, Haifeng Liu:
Solving traveling salesman problem in the Adleman-Lipton model. Appl. Math. Comput. 219(4): 2267-2270 (2012)
2000 – 2009
- 2006
- [j1]Zhaocai Wang, Dongmei Xiao, Wenxia Li, Lin He:
A DNA procedure for solving the shortest path problem. Appl. Math. Comput. 183(1): 79-84 (2006)
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-10-07 21:21 CEST 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:
