default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Hamada
Person information
- affiliation: KLab Inc., Tokyo, Japan
- affiliation: RIKEN Center for Advanced Intelligence Project, Tokyo, Japan
- affiliation: Fujitsu Laboratories, Kawasaki, Japan
- affiliation (PhD): Tokyo Institute of Technology, Interdisciplinary Graduate School of Science and Engineering, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Likun Liu
, Ryosuke Ota, Takahiro Yamamoto, Naoki Hamada, Daisuke Sakurai:
Visualization of Multiobjective Multimodal Benchmarking Based on Basin Connectivity. GECCO Companion 2024: 347-350- 2023
- [c14]Atsushi Takada, Daichi Yamazaki, Yudai Yoshida, Nyamkhuu Ganbat, Takayuki Shimotomai, Naoki Hamada, Likun Liu, Taiga Yamamoto, Daisuke Sakurai:
GenéLive! Generating Rhythm Actions in Love Live! AAAI 2023: 5266-5275 - 2022
- [j2]Naoki Hamada, Shunsuke Ichiki:
Free Disposal Hull Condition to Verify When Efficiency Coincides with Weak Efficiency. J. Optim. Theory Appl. 192(1): 248-270 (2022) - [c13]Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi, Hiroshi Umeki, Shinichi Shirakawa, Naoki Hamada:
A two-phase framework with a bézier simplex-based interpolation method for computationally expensive multi-objective optimization. GECCO 2022: 601-610 - [i10]Atsushi Takada, Daichi Yamazaki, Likun Liu, Yudai Yoshida, Nyamkhuu Ganbat, Takayuki Shimotomai, Taiga Yamamoto, Daisuke Sakurai, Naoki Hamada:
GenéLive! Generating Rhythm Actions in Love Live! CoRR abs/2202.12823 (2022) - [i9]Ryoji Tanabe, Youhei Akimoto, Ken Kobayashi, Hiroshi Umeki, Shinichi Shirakawa, Naoki Hamada:
A Two-phase Framework with a Bézier Simplex-based Interpolation Method for Computationally Expensive Multi-objective Optimization. CoRR abs/2203.15292 (2022) - [i8]Akiyoshi Sannai, Yasunari Hikima, Ken Kobayashi, Akinori Tanaka, Naoki Hamada:
Bézier Flow: a Surface-wise Gradient Descent Method for Multi-objective Optimization. CoRR abs/2205.11099 (2022) - 2021
- [i7]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Approximate Bayesian Computation of Bézier Simplices. CoRR abs/2104.04679 (2021) - [i6]Yusuke Mizota, Naoki Hamada, Shunsuke Ichiki:
All unconstrained strongly convex problems are weakly simplicial. CoRR abs/2106.12704 (2021) - [i5]Reiya Hagiwara, Takahiro Yamamoto, Naoki Hamada, Daisuke Sakurai:
Explicitly Multi-Modal Benchmarks for Multi-Objective Optimization. CoRR abs/2110.03196 (2021) - 2020
- [j1]Naoki Hamada, Kenta Hayano, Shunsuke Ichiki, Yutaro Kabata, Hiroshi Teramoto:
Topology of Pareto Sets of Strongly Convex Problems. SIAM J. Optim. 30(3): 2659-2686 (2020) - [c12]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Asymptotic Risk of Bézier Simplex Fitting. AAAI 2020: 2416-2424
2010 – 2019
- 2019
- [c11]Ken Kobayashi, Naoki Hamada, Akiyoshi Sannai, Akinori Tanaka, Kenichi Bannai, Masashi Sugiyama:
Bézier Simplex Fitting: Describing Pareto Fronts of Simplicial Problems with Small Samples in Multi-Objective Optimization. AAAI 2019: 2304-2313 - [c10]Yukito Tsunoda, Takahiro Notsu, Yasufumi Sakai, Naoki Hamada, Toshihiko Mori, Teruo Ishihara, Atsuki Inoue:
Neural-network assistance to calculate precise eigenvalue for fitness evaluation of real product design. GECCO (Companion) 2019: 405-406 - [i4]Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada:
Asymptotic Risk of Bezier Simplex Fitting. CoRR abs/1906.06924 (2019) - 2018
- [c9]Naoki Hamada, Keisuke Goto:
Data-driven analysis of pareto set topology. GECCO 2018: 657-664 - [i3]Naoki Hamada, Keisuke Goto:
Data-Driven Analysis of Pareto Set Topology. CoRR abs/1804.07179 (2018) - 2017
- [c8]Naoki Hamada, Kazuhisa Chiba:
Knee point analysis of many-objective Pareto fronts based on Reeb graph. CEC 2017: 1603-1612 - [c7]Naoki Hamada:
Simple problems: the simplicial gluing structure of pareto sets and pareto fronts. GECCO (Companion) 2017: 315-316 - [i2]Naoki Hamada:
Simple Problems: The Simplicial Gluing Structure of Pareto Sets and Pareto Fronts. CoRR abs/1709.10377 (2017) - 2015
- [c6]Naoki Hamada, Katsumi Homma, Hiroyuki Higuchi, Hideyuki Kikuchi:
Population Synthesis via k-Nearest Neighbor Crossover Kernel. ICDM 2015: 763-768 - [i1]Naoki Hamada, Katsumi Homma, Hiroyuki Higuchi, Hideyuki Kikuchi:
Population Synthesis via k-Nearest Neighbor Crossover Kernel. CoRR abs/1508.06483 (2015) - 2012
- [c5]Ryo Miyazaki, Naoki Hamada, Yuichi Nagata, Isao Ono:
A new Pareto frontier covering strategy in FS-MOGA for multi-objective function optimization. SCIS&ISIS 2012: 1888-1893 - 2011
- [c4]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
On scalability of Adaptive Weighted Aggregation for multiobjective function optimization. IEEE Congress on Evolutionary Computation 2011: 669-678 - [c3]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
Adaptive Weighted Aggregation 2: More scalable AWA for multiobjective function optimization. IEEE Congress on Evolutionary Computation 2011: 2375-2382 - 2010
- [c2]Naoki Hamada, Yuichi Nagata, Shigenobu Kobayashi, Isao Ono:
Adaptive weighted aggregation: A multiobjective function optimization framework taking account of spread and evenness of approximate solutions. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2008
- [c1]Naoki Hamada, Jun Sakuma, Shigenobu Kobayashi, Isao Ono:
Functional-Specialization Multi-Objective Real-Coded Genetic Algorithm: FS-MOGA. PPSN 2008: 691-701
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 2025-01-21 00:12 CET 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:
