default search action
Yang Nan 0001
Person information
- affiliation: Southern University of Science and Technology, Department of Computer Science and Engineering, Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation, Shenzhen, China
Other persons with the same name
- Yang Nan — disambiguation page
- Yang Nan 0002 — Imperial College London, National Heart & Lung Institute, London, UK (and 2 more)
- Yang Nan 0003 — Beijing Jiaotong University, School of Electronics and Information Engineering, Beijing, China
- Yang Nan 0004 — Wuhan University, GNSS Research Center, Wuhan, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c36]Yang Nan, Hisao Ishibuchi, Tianye Shu:
Performance Evaluation of Evolutionary Multi-Objective Algorithms Using Real-World Problems with an Additional Total Constraint Violation Objective. CEC 2024: 1-6 - [c35]Cheng Gong, Yang Nan, Tianye Shu, Lie Meng Pang, Hisao Ishibuchi, Qingfu Zhang:
Interactive Final Solution Selection in Multi-Objective Optimization. CEC 2024: 1-9 - [c34]Tianye Shu, Yang Nan, Ke Shang, Hisao Ishibuchi:
Last-X-Generation Archiving Strategy for Multi-Objective Evolutionary Algorithms. CEC 2024: 1-8 - [c33]Yang Nan, Hisao Ishibuchi, Tianye Shu, Ke Shang:
Analysis of Real-World Constrained Multi-Objective Problems and Performance Comparison of Multi-Objective Algorithms. GECCO 2024 - [c32]Yang Nan, Hisao Ishibuchi, Tianye Shu, Ke Shang:
Gradient-Guided Local Search for IGD/IGDPlus Subset Selection. GECCO 2024 - [c31]Cheng Gong, Yang Nan, Lie Meng Pang, Hisao Ishibuchi, Qingfu Zhang:
Heuristic Initialization and Knowledge-based Mutation for Large-Scale Multi-Objective 0-1 Knapsack Problems. GECCO 2024 - [c30]Cheng Gong, Yang Nan, Lie Meng Pang, Hisao Ishibuchi, Qingfu Zhang:
Performance of NSGA-III on Multi-objective Combinatorial Optimization Problems Heavily Depends on Its Implementations. GECCO 2024 - [c29]Tianye Shu, Ke Shang, Cheng Gong, Yang Nan, Hisao Ishibuchi:
Learning Pareto Set for Multi-Objective Continuous Robot Control. IJCAI 2024: 4920-4928 - [c28]Lie Meng Pang, Hisao Ishibuchi, Yang Nan, Cheng Gong:
Reliability of Indicator-Based Comparison Results of Evolutionary Multi-objective Algorithms. PPSN (4) 2024: 285-298 - [i4]Tianye Shu, Ke Shang, Cheng Gong, Yang Nan, Hisao Ishibuchi:
Learning Pareto Set for Multi-Objective Continuous Robot Control. CoRR abs/2406.18924 (2024) - 2023
- [j9]Ke Shang, Tianye Shu, Hisao Ishibuchi, Yang Nan, Lie Meng Pang:
Benchmarking large-scale subset selection in evolutionary multi-objective optimization. Inf. Sci. 622: 755-770 (2023) - [j8]Linjun He, Auraham Camacho, Yang Nan, Anupam Trivedi, Hisao Ishibuchi, Dipti Srinivasan:
Effects of corner weight vectors on the performance of decomposition-based multiobjective algorithms. Swarm Evol. Comput. 79: 101305 (2023) - [j7]Tianye Shu, Ke Shang, Hisao Ishibuchi, Yang Nan:
Effects of Archive Size on Computation Time and Solution Quality for Multiobjective Optimization. IEEE Trans. Evol. Comput. 27(4): 1145-1153 (2023) - [j6]Linjun He, Ke Shang, Yang Nan, Hisao Ishibuchi, Dipti Srinivasan:
Relation Between Objective Space Normalization and Weight Vector Scaling in Decomposition-Based Multiobjective Evolutionary Algorithms. IEEE Trans. Evol. Comput. 27(5): 1177-1191 (2023) - [j5]Yang Nan, Ke Shang, Hisao Ishibuchi, Linjun He:
An Improved Local Search Method for Large-Scale Hypervolume Subset Selection. IEEE Trans. Evol. Comput. 27(6): 1690-1704 (2023) - [c27]Yang Nan, Tianye Shu, Hisao Ishibuchi:
Effects of External Archives on the Performance of Multi-Objective Evolutionary Algorithms on Real-World Problems. CEC 2023: 1-8 - [c26]Lie Meng Pang, Yang Nan, Hisao Ishibuchi:
Partially Degenerate Multi-objective Test Problems. EMO 2023: 277-290 - [c25]Hisao Ishibuchi, Yang Nan, Lie Meng Pang:
Performance Evaluation of Multi-objective Evolutionary Algorithms Using Artificial and Real-world Problems. EMO 2023: 333-347 - [c24]Yang Nan, Hisao Ishibuchi, Tianye Shu, Ke Shang:
Two-Stage Greedy Approximated Hypervolume Subset Selection for Large-Scale Problems. EMO 2023: 391-404 - [c23]Linjun He, Yang Nan, Hisao Ishibuchi, Dipti Srinivasan:
Preference-Based Nonlinear Normalization for Multiobjective Optimization. EMO 2023: 563-577 - [c22]Cheng Gong, Yang Nan, Lie Meng Pang, Qingfu Zhang, Hisao Ishibuchi:
Effects of Including Optimal Solutions into Initial Population on Evolutionary Multiobjective Optimization. GECCO 2023: 661-669 - [c21]Linjun He, Yang Nan, Hisao Ishibuchi, Dipti Srinivasan:
Effects of Objective Space Normalization in Multi-Objective Evolutionary Algorithms on Real-World Problems. GECCO 2023: 670-678 - [c20]Tianye Shu, Yang Nan, Ke Shang, Hisao Ishibuchi:
Two-Phase Procedure for Efficiently Removing Dominated Solutions From Large Solution Sets. GECCO 2023: 740-748 - [c19]Yang Nan, Tianye Shu, Hisao Ishibuchi:
Two-Stage Lazy Greedy Inclusion Hypervolume Subset Selection for Large-Scale Problem. SMC 2023: 1154-1161 - [c18]Cheng Gong, Lie Meng Pang, Yang Nan, Hisao Ishibuchi, Qingfu Zhang:
Effects of Initialization Methods on the Performance of Multi-Objective Evolutionary Algorithms. SMC 2023: 1168-1175 - [c17]Lie Meng Pang, Yang Nan, Hisao Ishibuchi:
How to Find a Large Solution Set to Cover the Entire Pareto Front in Evolutionary Multi-Objective Optimization. SMC 2023: 1188-1194 - [c16]Ke Shang, Tianye Shu, Guotong Wu, Yang Nan, Lie Meng Pang, Hisao Ishibuchi:
Empirical Hypervolume Optimal µ-Distributions on Complex Pareto Fronts. SSCI 2023: 433-440 - [c15]Tianye Shu, Yang Nan, Ke Shang, Hisao Ishibuchi:
Analysis of Partition Methods for Dominated Solution Removal from Large Solution Sets. SSCI 2023: 441-448 - [c14]Jinyuan Zhang, Hisao Ishibuchi, Linjun He, Yang Nan:
Effects of Initialization Methods on the Performance of Surrogate-Based Multiobjective Evolutionary Algorithms. SSCI 2023: 933-940 - [c13]Cheng Gong, Yang Nan, Lie Meng Pang, Hisao Ishibuchi, Qingfu Zhang:
Initial Populations with a Few Heuristic Solutions Significantly Improve Evolutionary Multi-Objective Combinatorial Optimization. SSCI 2023: 1398-1405 - [c12]Guotong Wu, Tianye Shu, Yang Nan, Ke Shang, Hisao Ishibuchi:
Ensemble R2-based Hypervolume Contribution Approximation. SSCI 2023: 1503-1510 - [c11]Cheng Gong, Yang Nan, Lie Meng Pang, Hisao Ishibuchi, Qingfu Zhang:
Examination of the Multimodal Nature of Multi-Objective Neural Architecture Search. SSCI 2023: 1821-1828 - 2022
- [j4]Ke Shang, Hisao Ishibuchi, Weiyu Chen, Yang Nan, Weiduo Liao:
Hypervolume-Optimal μ-Distributions on Line/Plane-Based Pareto Fronts in Three Dimensions. IEEE Trans. Evol. Comput. 26(2): 349-363 (2022) - [c10]Tianye Shu, Ke Shang, Yang Nan, Hisao Ishibuchi:
Direction Vector Selection for R2-Based Hypervolume Contribution Approximation. PPSN (2) 2022: 110-123 - [i3]Ke Shang, Tianye Shu, Hisao Ishibuchi, Yang Nan, Lie Meng Pang:
Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization. CoRR abs/2201.06700 (2022) - [i2]Tianye Shu, Ke Shang, Hisao Ishibuchi, Yang Nan:
Effects of Archive Size on Computation Time and Solution Quality for Multi-Objective Optimization. CoRR abs/2209.03100 (2022) - 2021
- [j3]Linjun He, Hisao Ishibuchi, Anupam Trivedi, Handing Wang, Yang Nan, Dipti Srinivasan:
A Survey of Normalization Methods in Multiobjective Evolutionary Algorithms. IEEE Trans. Evol. Comput. 25(6): 1028-1048 (2021) - [c9]Yang Nan, Ke Shang, Hisao Ishibuchi, Linjun He:
A Two-stage Hypervolume Contribution Approximation Method Based on R2 Indicator. CEC 2021: 2468-2475 - [c8]Ke Shang, Hisao Ishibuchi, Yang Nan:
Distance-based subset selection revisited. GECCO 2021: 439-447 - [c7]Ke Shang, Hisao Ishibuchi, Lie Meng Pang, Yang Nan:
Reference Point Specification for Greedy Hypervolume Subset Selection. SMC 2021: 168-175 - [c6]Yang Nan, Ke Shang, Hisao Ishibuchi, Linjun He:
Improving Local Search Hypervolume Subset Selection in Evolutionary Multi-objective Optimization. SMC 2021: 751-757 - [i1]Ke Shang, Hisao Ishibuchi, Weiyu Chen, Yang Nan, Weiduo Liao:
Hypervolume-Optimal μ-Distributions on Line/Plane-based Pareto Fronts in Three Dimensions. CoRR abs/2104.09736 (2021) - 2020
- [j2]Yang Nan, Ke Shang, Hisao Ishibuchi, Linjun He:
Reverse Strategy for Non-Dominated Archiving. IEEE Access 8: 119458-119469 (2020) - [c5]Yang Nan, Ke Shang, Hisao Ishibuchi:
What is a good direction vector set for the R2-based hypervolume contribution approximation. GECCO 2020: 524-532 - [c4]Ke Shang, Hisao Ishibuchi, Yang Nan, Weiyu Chen:
Transformation-based Hypervolume Indicator: A Framework for Designing Hypervolume Variants. SSCI 2020: 157-164
2010 – 2019
- 2019
- [c3]Linjun He, Yang Nan, Ke Shang, Hisao Ishibuchi:
A Study of the Naïve Objective Space Normalization Method in MOEA/D. SSCI 2019: 1834-1840 - 2018
- [j1]Chenyu Huang, Chenchang Zhan, Linjun He, Lidan Wang, Yang Nan:
A 0.6-V Minimum-Supply, 23.5 ppm/°C Subthreshold CMOS Voltage Reference With 0.45% Variation Coefficient. IEEE Trans. Circuits Syst. II Express Briefs 65-II(10): 1290-1294 (2018) - [c2]Yang Nan, Chenchang Zhan, Guanhua Wang, Linjun He, Han Li:
Replica-Based Low Drop-Out Voltage Regulator with Assistant Power Transistors for Digital VLSI Systems. ISVLSI 2018: 6-9 - [c1]Linjun He, Chenchang Zhan, Yang Nan, Ning Zhang, Lidan Wang, Guofeng Li:
A 0.5V 46.2ppm°C CMOS Voltage Reference Based on Compensated ΔVTH with Wide Temperature Range and High PSRR. NEWCAS 2018: 66-69
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-11-14 21:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint