default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Sakamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Naoki Sakamoto, Rei Sato, Kazuto Fukuchi
, Jun Sakuma, Youhei Akimoto:
Explicitly Constrained Black-Box Optimization With Disconnected Feasible Domains Using Deep Generative Models. IEEE Access 10: 117501-117514 (2022)- [j3]Naoki Sakamoto, Youhei Akimoto:
Adaptive Ranking-Based Constraint Handling for Explicitly Constrained Black-Box Optimization. Evol. Comput. 30(4): 503-529 (2022) - 2021
- [c10]Kenta Kishishita, Naoki Sakamoto, Hiroaki Muranami, Kazuhiro Hattori, Yuichi Kurita:
Effect of surface textures on the fingertip forces perception and output. WHC 2021: 25-30 - 2020
- [c9]Naoki Sakamoto, Eiji Semmatsu, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Deep generative model for non-convex constraint handling. GECCO 2020: 636-644 - [c8]Youhei Akimoto, Naoki Sakamoto, Makoto Ohtani:
Multi-fidelity Optimization Approach Under Prior and Posterior Constraints and Its Application to Compliance Minimization. PPSN (1) 2020: 81-94
2010 – 2019
- 2019
- [c7]Naoki Sakamoto, Youhei Akimoto:
Adaptive ranking based constraint handling for explicitly constrained black-box optimization. GECCO 2019: 700-708 - 2018
- [c6]Kyotaro Ohashi, Natsuki Fujiyoshi, Naoki Sakamoto, Youhei Akimoto:
Model parameter adaptive instance-based policy optimization for episodic control tasks of nonholonomic systems. GECCO (Companion) 2018: 1426-1433 - [i1]Naoki Sakamoto, Youhei Akimoto:
Ranking Based Linear Constraint Handling Method with Adaptive Penalty. CoRR abs/1811.00764 (2018) - 2017
- [c5]Naoki Sakamoto, Youhei Akimoto:
Modified box constraint handling for the covariance matrix adaptation evolution strategy. GECCO (Companion) 2017: 183-184 - 2011
- [j2]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. IEICE Trans. Inf. Syst. 94-D(2): 190-195 (2011) - 2010
- [c4]Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki:
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. FAW 2010: 274-284
2000 – 2009
- 2009
- [j1]Naoki Sakamoto, Mitsuru Higashimori, Toshio Tsuji, Makoto Kaneko:
An optimum design of robotic food handling by using Burger model. Intell. Serv. Robotics 2(1): 53-60 (2009) - 2008
- [c3]Naoki Sakamoto, Mitsuru Higashimori, Toshio Tsuji, Makoto Kaneko:
Piercing based grasping by using self-tightening effect. ICRA 2008: 4055-4060 - [c2]Chia-Hung Dylan Tsai, Imin Kao, Naoki Sakamoto, Mitsuru Higashimori, Makoto Kaneko:
Applying viscoelastic contact modeling to grasping task: An experimental case study. IROS 2008: 1790-1795 - 2007
- [c1]Naoki Sakamoto, Mitsuru Higashimori, Toshio Tsuji, Makoto Kaneko:
An Optimum Design of Robotic Hand for Handling a Visco-elastic Object Based on Maxwell Model. ICRA 2007: 1219-1225
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-04-24 23:13 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:
