default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeijie Zheng 0001
Person information
- affiliation: Harbin Institute of Technology Shenzhen, China
- affiliation: Tsinghua University, Beijing, China
- affiliation: Southern University of Science and Technology, Shenzhen, China
Other persons with the same name
- Weijie Zheng — disambiguation page
- Weijie Zheng 0002 — Anqing Normal University, Anqing, Anhui, China
- Weijie Zheng 0003 — Minnan Normal University, Zhangzhou, Fujian, China
- Weijie Zheng 0004 — Nanchang Hangkong University, China
- Weijie Zheng 0005 — Changchun University of Science and Technology, School of Science, China
- Weijie Zheng 0006 — Anhui University, School of Computer Science and Technology, Hefei, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Shouda Wang, Weijie Zheng
, Benjamin Doerr:
Choosing the right algorithm with hints from complexity theory. Inf. Comput. 296: 105125 (2024)- [j9]Weijie Zheng, Benjamin Doerr:
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency for Many Objectives. IEEE Trans. Evol. Comput. 28(5): 1442-1454 (2024) - [c25]Weijie Zheng, Benjamin Doerr:
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. AAAI 2024: 20874-20882 - [c24]Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr:
How to Use the Metropolis Algorithm for Multi-Objective Optimization? AAAI 2024: 20883-20891 - [c23]Weijie Zheng, Benjamin Doerr:
Hot off the Press: Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives. GECCO Companion 2024: 67-68 - [c22]Weijie Zheng, Benjamin Doerr:
Hot off the Press: Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. GECCO Companion 2024: 69-70 - [c21]Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr:
How to Use the Metropolis Algorithm for Multi-Objective Optimization? GECCO Companion 2024: 71-72 - [c20]Joshua D. Knowles, Weijie Zheng:
Evolutionary Multiobjective Optimization (EMO). GECCO Companion 2024: 1432-1459 - [c19]Renzhong Deng, Weijie Zheng, Mingfeng Li, Jie Liu, Benjamin Doerr:
Runtime Analysis for State-of-the-Art Multi-objective Evolutionary Algorithms on the Subset Selection Problem. PPSN (3) 2024: 264-279 - [c18]Mingfeng Li, Weijie Zheng, Wen Xie, Ao Sun, Xin Yao:
When Does the Time-Linkage Property Help Optimization by Evolutionary Algorithms? PPSN (3) 2024: 280-294 - [i14]Weijie Zheng, Benjamin Doerr:
Overcome the Difficulties of NSGA-II via Truthful Crowding Distance with Theoretical Guarantees. CoRR abs/2407.17687 (2024) - 2023
- [j8]Weijie Zheng, Benjamin Doerr:
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II). Artif. Intell. 325: 104016 (2023) - [j7]Weijie Zheng, Benjamin Doerr:
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. Evol. Comput. 31(4): 337-373 (2023) - [j6]Weijie Zheng, Benjamin Doerr:
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. J. Mach. Learn. Res. 24: 292:1-292:40 (2023) - [i13]Weijie Zheng, Xin Yao:
Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights. CoRR abs/2305.07098 (2023) - [i12]Weijie Zheng, Benjamin Doerr:
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization. CoRR abs/2312.10290 (2023) - 2022
- [c17]Weijie Zheng, Yufei Liu, Benjamin Doerr:
A First Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II). AAAI 2022: 10408-10416 - [c16]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the right algorithm with hints from complexity theory: (hot-off-the-press track at GECCO 2022). GECCO Companion 2022: 45-46 - [c15]Weijie Zheng, Yufei Liu, Benjamin Doerr:
A first mathematical runtime analysis of the non-dominated sorting genetic algorithm II (NSGA-II): (hot-off-the-press track at GECCO 2022). GECCO Companion 2022: 53-54 - [c14]Weijie Zheng, Benjamin Doerr:
Better approximation guarantees for the NSGA-II by using the current crowding distance. GECCO 2022: 611-619 - [i11]Weijie Zheng, Benjamin Doerr:
Better Approximation Guarantees for the NSGA-II by Using the Current Crowding Distance. CoRR abs/2203.02693 (2022) - [i10]Weijie Zheng, Benjamin Doerr:
From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms. CoRR abs/2206.09090 (2022) - [i9]Weijie Zheng, Benjamin Doerr:
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Three or More Objectives. CoRR abs/2211.13084 (2022) - 2021
- [j5]Weijie Zheng, Huanhuan Chen, Xin Yao:
Analysis of Evolutionary Algorithms on Fitness Function With Time-Linkage Property. IEEE Trans. Evol. Comput. 25(4): 696-709 (2021) - [c13]Benjamin Doerr, Weijie Zheng:
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. AAAI 2021: 12293-12301 - [c12]Benjamin Doerr, Weijie Zheng:
Theoretical analyses of multi-objective evolutionary algorithms on multi-modal objectives: (hot-off-the-press track at GECCO 2021). GECCO Companion 2021: 25-26 - [c11]Weijie Zheng, Huanhuan Chen, Xin Yao:
Analysis of evolutionary algorithms on fitness function with time-linkage property (hot-off-the-press track at GECCO 2021). GECCO Companion 2021: 47-48 - [c10]Weijie Zheng, Qiaozhi Zhang, Huanhuan Chen, Xin Yao:
When non-elitism meets time-linkage problems. GECCO 2021: 741-749 - [c9]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the Right Algorithm With Hints From Complexity Theory. IJCAI 2021: 1697-1703 - [i8]Weijie Zheng, Qiaozhi Zhang, Huanhuan Chen, Xin Yao:
When Non-Elitism Meets Time-Linkage Problems. CoRR abs/2104.06831 (2021) - [i7]Shouda Wang, Weijie Zheng, Benjamin Doerr:
Choosing the Right Algorithm With Hints From Complexity Theory. CoRR abs/2109.06584 (2021) - [i6]Weijie Zheng, Yufei Liu, Benjamin Doerr:
A First Mathematical Runtime Analysis of the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). CoRR abs/2112.08581 (2021) - 2020
- [j4]Liandeng Li, Jiarui Fang, Jinlei Jiang, Lin Gan, Weijie Zheng, Haohuan Fu, Guangwen Yang:
Efficient AES implementation on Sunway TaihuLight supercomputer: A systematic approach. J. Parallel Distributed Comput. 138: 178-189 (2020) - [j3]Benjamin Doerr, Weijie Zheng:
Working principles of binary differential evolution. Theor. Comput. Sci. 801: 110-142 (2020) - [j2]Benjamin Doerr, Weijie Zheng:
Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms. IEEE Trans. Evol. Comput. 24(6): 1140-1149 (2020) - [c8]Benjamin Doerr, Weijie Zheng:
Sharp bounds for genetic drift in estimation of distribution algorithms (Hot-off-the-press track at GECCO 2020). GECCO Companion 2020: 15-16 - [c7]Benjamin Doerr, Weijie Zheng:
From understanding genetic drift to a smart-restart parameter-less compact genetic algorithm. GECCO 2020: 805-813 - [i5]Benjamin Doerr, Weijie Zheng:
From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm. CoRR abs/2004.07141 (2020) - [i4]Weijie Zheng, Huanhuan Chen, Xin Yao:
Analysis of Evolutionary Algorithms on Fitness Function with Time-linkage Property. CoRR abs/2004.12304 (2020) - [i3]Benjamin Doerr, Weijie Zheng:
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives. CoRR abs/2012.07231 (2020)
2010 – 2019
- 2019
- [i2]Benjamin Doerr, Weijie Zheng:
Sharp Bounds for Genetic Drift in EDAs. CoRR abs/1910.14389 (2019) - 2018
- [j1]Wenlai Zhao, Haohuan Fu, Jiarui Fang, Weijie Zheng, Lin Gan, Guangwen Yang:
Optimizing Convolutional Neural Networks on the Sunway TaihuLight Supercomputer. ACM Trans. Archit. Code Optim. 15(1): 13:1-13:26 (2018) - [c6]Weijie Zheng, Guangwen Yang, Benjamin Doerr:
Working principles of binary differential evolution. GECCO 2018: 1103-1110 - [i1]Benjamin Doerr, Weijie Zheng:
Working Principles of Binary Differential Evolution. CoRR abs/1812.03513 (2018) - 2017
- [c5]Jiarui Fang, Haohuan Fu, Wenlai Zhao, Bingwei Chen, Weijie Zheng, Guangwen Yang:
swDNN: A Library for Accelerating Deep Learning Applications on Sunway TaihuLight. IPDPS 2017: 615-624 - [c4]Liandeng Li, Jiarui Fang, Jinlei Jiang, Lin Gan, Weijie Zheng, Haohuan Fu, Guangwen Yang:
SW-AES: Accelerating AES Algorithm on the Sunway TaihuLight. ISPA/IUCC 2017: 1204-1211 - 2016
- [c3]Weijie Zheng, Haohuan Fu, Guangwen Yang:
TADE: Tight Adaptive Differential Evolution. PPSN 2016: 113-122 - [c2]Haohuan Fu, Junfeng Liao, Wei Xue, Lanning Wang, Dexun Chen, Long Gu, Jinxiu Xu, Nan Ding, Xinliang Wang, Conghui He, Shizhen Xu, Yishuang Liang, Jiarui Fang, Yuanchao Xu, Weijie Zheng, Jingheng Xu, Zhen Zheng, Wanjing Wei, Xu Ji, He Zhang, Bingwei Chen, Kaiwei Li, Xiaomeng Huang, Wenguang Chen, Guangwen Yang:
Refactoring and optimizing the community atmosphere model (CAM) on the sunway taihulight supercomputer. SC 2016: 969-980 - 2015
- [c1]Weijie Zheng, Haohuan Fu, Guangwen Yang:
Targeted Mutation: A Novel Mutation Strategy for Differential Evolution. ICTAI 2015: 286-293
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-23 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:
