default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYu Setoguchi
Person information
- affiliation: Osaka Prefecture University, Sakai, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j4]Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima
:
How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison. Evol. Comput. 26(3) (2018)- [j3]Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Reference Point Specification in Inverted Generational Distance for Triangular Linear Pareto Front. IEEE Trans. Evol. Comput. 22(6): 961-975 (2018) - 2017
- [j2]Hisao Ishibuchi, Yu Setoguchi, Hiroyuki Masuda, Yusuke Nojima:
Performance of Decomposition-Based Many-Objective Algorithms Strongly Depends on Pareto Front Shapes. IEEE Trans. Evol. Comput. 21(2): 169-190 (2017) - 2016
- [j1]Kaname Narukawa, Yu Setoguchi, Yuki Tanigaki, Markus Olhofer, Bernhard Sendhoff, Hisao Ishibuchi:
Preference representation using Gaussian functions on a hyperplane in evolutionary multi-objective optimization. Soft Comput. 20(7): 2733-2757 (2016)
Conference and Workshop Papers
- 2017
- [c6]Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems. FOGA 2017: 95-110 - [c5]Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Reference point specification in hypervolume calculation for fair comparison and efficient search. GECCO 2017: 585-592 - 2016
- [c4]Hisao Ishibuchi, Yu Setoguchi, Hiroyuki Masuda, Yusuke Nojima:
How to compare many-objective algorithms under different settings of population and archive sizes. CEC 2016: 1149-1156 - [c3]Hisao Ishibuchi, Ryo Imada, Yu Setoguchi, Yusuke Nojima:
Performance comparison of NSGA-II and NSGA-III on various many-objective test problems. CEC 2016: 3045-3052 - 2015
- [c2]Yuki Tanigaki, Hiroyuki Masuda, Yu Setoguchi, Yusuke Nojima, Hisao Ishibuchi:
Algorithm structure optimization by choosing operators in multiobjective genetic local search. CEC 2015: 854-861 - [c1]Yu Setoguchi, Kaname Narukawa, Hisao Ishibuchi:
A Knee-Based EMO Algorithm with an Efficient Method to Update Mobile Reference Points. EMO (1) 2015: 202-217
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-08 21:43 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:
