default search action
Juan Zhao 0004
Person information
- affiliation: Jingchu University of Technology, School of Electronics and Information Enginnering, Jingmen, China
Other persons with the same name
- Juan Zhao — disambiguation page
- Juan Zhao 0001 — Beijing Institute of Technology, School of Information and Electronics, China
- Juan Zhao 0002
— Nanjing University of Posts and Telecommunications (NJUPT), School of Communication and Information Engineering, China
- Juan Zhao 0003
- Juan Zhao 0005 — Singapore University of Technology and Design, Pillar of Information Systems Technology and Design, Singapore
- Juan Zhao 0006
- Juan Zhao 0007
- Juan Zhao 0008
- Juan Zhao 0009
- Juan Zhao 0010 — Wuhan Polytechnic University, School of Mathematics and Computer Science, China (and 1 more)
- Juan Zhao 0011 — Aba Teachers College, Department of Foreign Language, Sichuan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Zheng-Ming Gao
Image recognition of insect pests in Jingmen with YOLOv10. MLMI 2024: 204-208 - 2023
- [c8]Juan Zhao, Yuan-Man Liu, Zheng-Ming Gao:
Application of the Simplified Aquila Optimizer with the Multiple Updating Principle in Unmanned Aerial Vehicle Path Planning. ICCCS 2023: 1163-1168 - 2022
- [j5]Yujun Zhang
AOAAO: The Hybrid Algorithm of Arithmetic Optimization Algorithm With Aquila Optimizer. IEEE Access 10: 10907-10933 (2022) - [j4]Juan Zhao
The Simplified Aquila Optimization Algorithm. IEEE Access 10: 22487-22515 (2022) - [j3]Yujun Zhang
Self-adaptive classification learning hybrid JAYA and Rao-1 algorithm for large-scale numerical and engineering problems. Eng. Appl. Artif. Intell. 114: 105069 (2022) - [c7]Jia-Hao Zhang, Zheng-Ming Gao, Su-Ruo Li, Juan Zhao:
Improved Mayfly Optimization Algorithm with Cooperation. ICCCS 2022: 1-6 - 2021
- [j2]Zheng-Ming Gao
The Challenge for the Nature-Inspired Global Optimization Algorithms: Non-Symmetric Benchmark Functions. IEEE Access 9: 106317-106339 (2021) - [c6]Yun-Feng Zou, Juan Zhao, Zheng-Ming Gao:
Guaranteed Convergence Sine Cosine Algorithm. EITCE 2021: 986-990 - 2020
- [c5]Zheng-Ming Gao
The Improved Equilibrium Optimization Algorithm with Tent Map. ICCCS 2020: 343-346 - [c4]Juan Zhao, Zheng-Ming Gao
The Improved Equilibrium Optimization Algorithm with Levy Flight. ICCCS 2020: 352-355 - [c3]Juan Zhao, Zheng-Ming Gao
Simulation Research on the Binary Equilibrium Optimization Algorithm. ICMLC 2020: 140-144 - [c2]Zheng-Ming Gao
The Binary Equilibrium Optimization Algorithm with Sigmoid Transfer Functions. ICMLC 2020: 193-197 - [c1]Zheng-Ming Gao
Data Mining of Agricultural Software and Suggestions. MLMI 2020: 78-82
2010 – 2019
- 2019
- [j1]Zheng-Ming Gao
An Improved Grey Wolf Optimization Algorithm with Variable Weights. Comput. Intell. Neurosci. 2019: 2981282:1-2981282:13 (2019)
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-12-23 20:32 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: