Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Lin 0001
Person information
- affiliation: Fujian Agriculture and Forestry University, College of Computer and Information Science, Fuzhou, China
- affiliation: University of Lousiville, J.B. Speed School of Engineering, Louisville, KY, USA
Other persons with the same name
- Juan Lin — disambiguation page
- Juan Lin 0002
![[0000-0002-1121-6697]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1121-6697")
— Fuqing Branch of Fujian Normal University, Engineering Research Center for ICH Digitalization and Multi-Source Information Fusion, Fuzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Juan Lin, Ailing Shen, Liangcheng Wu, Yiwen Zhong:
Learning-based simulated annealing algorithm for unequal area facility layout problem. Soft Comput. 28(6): 5667-5682 (2024)- 2023
- [j13]Min Lin, Yuhang Yang, Yiwen Zhong, Juan Lin:
A real-coded chicken swarm optimisation algorithm for solving travelling salesman problem. Int. J. Comput. Sci. Math. 17(2): 166-181 (2023) - [c16]Li Hong, Yiwen Zhong, Juan Lin:
Simulated Annealing Algorithm for the Bounded Diameter Minimum Spanning Tree Problem. GECCO Companion 2023: 215-218 - [c15]Zhida Liu, Biao Di, Juan Lin:
A Multi-parent Hybrid Order and Cost-based Sequential Constructive Crossover of Genetic Algorithm for the Traveling Salesman Problem. ICCCM 2023: 129-135 - [c14]Zhida Liu, Juan Lin, Biao Di:
A Discrete Sine Cosine Algorithm with Enhanced Comprehensive Learning for Feature Selection. ICNC-FSKD 2023: 1-8 - 2022
- [c13]Ailing Shen, Juan Lin, Yiwen Zhong:
External archive hybrid genetic algorithm for unequal area facility layout problem. GECCO Companion 2022: 204-207 - [c12]Yufan Zhou, Xinhua Yang, Ailing Shen, Juan Lin, Yiwen Zhong:
Simulated Annealing Algorithm Based on Single-direction Greedy Decoding for Solving Corridor Allocation Problem. ICMLC 2022: 184-190 - 2021
- [c11]Xinhua Yang, Yufan Zhou, Ailing Shen, Juan Lin, Yiwen Zhong:
A hybrid ant colony optimization algorithm for the knapsack problem with a single continuous variable. GECCO 2021: 57-65 - [c10]Wenhan Deng, Ming Zhang, Kai He, Lijin Wang, Juan Lin, Yiwen Zhong:
A Mixed-coding Harmony Search Algorithm for the Closed Loop Layout Problem. ICMLC 2021: 93-100 - 2020
- [j12]Juan Lin, Yiwen Zhong, Ena Li:
Multi-agent list-based noising algorithm for protein structure prediction. Int. J. Wirel. Mob. Comput. 18(1): 90-100 (2020) - [j11]Juan Lin, Hui Zhang:
Accelerating visual communication of mathematical knot deformation. J. Vis. 23(5): 913-929 (2020) - [c9]Juan Lin, Hui Zhang:
Data Structure Visualization on the Web. IEEE BigData 2020: 3272-3279
2010 – 2019
- 2019
- [c8]Juan Lin, Hui Zhang:
View Selection in Knot Deformation. IEEE BigData 2019: 3365-3372 - [c7]Juan Lin, Hui Zhang:
Visualizing Mathematical Knot Equivalence. Visualization and Data Analysis 2019 - [c6]Juan Lin, Hui Zhang:
Visually Communicating Mathematical Knot Deformation. VINCI 2019: 20:1-20:8 - 2018
- [j10]Juan Lin, Yiwen Zhong, Ena Li, Xiaoyu Lin, Hui Zhang:
Multi-agent simulated annealing algorithm with parallel adaptive multiple sampling for protein structure prediction in AB off-lattice model. Appl. Soft Comput. 62: 491-503 (2018) - [j9]Min Lin, Yiwen Zhong, Juan Lin, Xiaoyu Lin:
Enhanced chicken swarm optimisation for function optimisation problem. Int. J. Wirel. Mob. Comput. 15(3): 258-269 (2018) - [j8]Yiwen Zhong, Juan Lin, Lijin Wang, Hui Zhang:
Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol. Comput. 42: 77-88 (2018) - [c5]Juan Lin, Hui Zhang:
Untangling Mathematical Knots with Simulated Annealing and Opposition-Based Learning. IEEE BigData 2018: 4245-4253 - 2017
- [j7]Yiwen Zhong, Juan Lin, Lijin Wang, Hui Zhang:
Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf. Sci. 421: 70-84 (2017) - [c4]Hui Zhang, Yiwen Zhong, Juan Lin:
Divide-and-conquer strategies for large-scale simulations in R. IEEE BigData 2017: 3517-3523 - 2016
- [j6]Shi-hua Zhan, Juan Lin, Ze-Jun Zhang, Yiwen Zhong:
List-Based Simulated Annealing Algorithm for Traveling Salesman Problem. Comput. Intell. Neurosci. 2016: 1712630:1-1712630:12 (2016) - [j5]Changying Wang, Juan Lin, Min Lin, Yiwen Zhong:
Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem. Int. J. Wirel. Mob. Comput. 10(2): 166-173 (2016) - [c3]Juan Lin, Di Zhong, Yiwen Zhong, Hui Zhang:
Accelerating mathematical knot simulations with R on the web. IEEE BigData 2016: 2315-2321 - 2015
- [j4]Yiwen Zhong, Juan Lin, Qingliang Du, Limei Wang:
Multi-agent simulated annealing algorithm based on differential perturbation for protein structure prediction problems. Int. J. Comput. Appl. Technol. 51(3): 164-172 (2015) - [j3]Juan Lin, Yiwen Zhong:
Multi-agent list-based threshold-accepting algorithm for numerical optimisation. Int. J. Comput. Sci. Math. 6(5): 501-509 (2015) - 2014
- [j2]Juan Lin, Yiwen Zhong:
Modified Shuffled Frog-leaping Algorithm with Dimension by Dimension Improvement. J. Comput. 9(10): 2352-2358 (2014) - 2013
- [j1]Yiwen Zhong, Juan Lin, Hui Yang, Hui Zhang:
Analysis of learning-based multi-agent simulated annealing algorithm for function optimisation problems. Int. J. Comput. Sci. Math. 4(4): 382-391 (2013) - 2011
- [c2]Yiwen Zhong, Juan Lin, Jing Ning, Xiaoyu Lin:
Hybrid artificial bee colony algorithm with chemotaxis behavior of bacterial foraging optimization algorithm. ICNC 2011: 1171-1174 - [c1]Juan Lin, Yiwen Zhong, Jun Zhang:
Discrete shuffled flog leaping algorithm for RNA secondary structure prediction. ICNC 2011: 1489-1493
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-05-02 23:48 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:
