Остановите войну!
for scientists:
default search action
Ke Shang
Publications
- 2023
- [j39]Ke Shang, Weiyu Chen, Weiduo Liao, Hisao Ishibuchi:
HV-Net: Hypervolume Approximation Based on DeepSets. IEEE Trans. Evol. Comput. 27(4): 1154-1160 (2023) - 2022
- [j31]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) - [j30]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Fast Greedy Subset Selection From Large Candidate Solution Sets in Evolutionary Multiobjective Optimization. IEEE Trans. Evol. Comput. 26(4): 750-764 (2022) - [i11]Ke Shang, Weiyu Chen, Weiduo Liao, Hisao Ishibuchi:
HV-Net: Hypervolume Approximation based on DeepSets. CoRR abs/2203.02185 (2022) - 2021
- [c37]Ke Shang, Hisao Ishibuchi, Longcan Chen, Weiyu Chen, Lie Meng Pang:
Improving the Efficiency of R2HCA-EMOA. EMO 2021: 115-125 - [c34]Ke Shang, Hisao Ishibuchi, Weiyu Chen:
Greedy approximated hypervolume subset selection for many-objective optimization. GECCO 2021: 448-456 - [c31]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization. SMC 2021: 468-475 - [c30]Lie Meng Pang, Ke Shang, Longcan Chen, Hisao Ishibuchi, Weiyu Chen:
Proposal of a New Test Problem for Large-Scale Multi- and Many-Objective Optimization. SMC 2021: 484-491 - [i9]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Fast Greedy Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization. CoRR abs/2102.00941 (2021) - [i8]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) - [i7]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization. CoRR abs/2108.08453 (2021) - 2020
- [c27]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Modified Distance-based Subset Selection for Evolutionary Multi-objective Optimization Algorithms. CEC 2020: 1-8 - [c26]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets. CEC 2020: 1-8 - [c23]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Proposal of a Realistic Many-Objective Test Suite. PPSN (1) 2020: 201-214 - [c22]Ke Shang, Hisao Ishibuchi, Weiyu Chen, Lukás Adam:
Hypervolume Optimal μ-Distributions on Line-Based Pareto Fronts in Three Dimensions. PPSN (2) 2020: 257-270 - [c17]Ke Shang, Hisao Ishibuchi, Yang Nan, Weiyu Chen:
Transformation-based Hypervolume Indicator: A Framework for Designing Hypervolume Variants. SSCI 2020: 157-164 - [i6]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Effects of Discretization of Decision and Objective Spaces on the Performance of Evolutionary Multiobjective Optimization Algorithms. CoRR abs/2003.09917 (2020) - [i4]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Lazy Greedy Hypervolume Subset Selection from Large Candidate Solution Sets. CoRR abs/2007.02050 (2020) - 2019
- [c12]Weiyu Chen, Hisao Ishibuchi, Ke Shang:
Effects of Discretization of Decision and Objective Spaces on the Performance of Evolutionary Multi-objective Optimization Algorithms. SSCI 2019: 1826-1833
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-04-25 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint