default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsutomu Inamoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j3]Tsutomu Inamoto, Yoshinobu Higami:
Formulation of a Test Pattern Measure That Counts Distinguished Fault-Pairs for Circuit Fault Diagnosis. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12): 1456-1463 (2020)- 2017
- [j2]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Trip-Based Integer Linear Programming Model for Static Multi-Car Elevator Operation Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(2): 385-394 (2017) - 2014
- [j1]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Optimal Periods for Probing Convergence of Infinite-stage Dynamic Programmings on GPUs. Int. J. Netw. Comput. 4(2): 321-335 (2014)
Conference and Workshop Papers
- 2022
- [c13]Tsutomu Inamoto, Tomoki Nishino, Senling Wang, Yoshinobu Higami, Hiroshi Takahashi:
Preliminary Study on Noise-Resilient Artificial Neural Networks for On-Chip Test Generation. GCCE 2022: 561-565 - 2017
- [c12]Tsutomu Inamoto, Yoshinobu Higami:
Harnessing Fuzziness of the Pragmatic Rule-Design Without IF-THEN Rules. FSDM 2017: 54-62 - 2016
- [c11]Kamoliddin Mavlonov, Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Design and Implementation of Data Synchronization and Offline Capabilities in Native Mobile Apps. ACIIDS (2) 2016: 61-71 - [c10]Kosuke Yamaguchi, Tsutomu Inamoto, Keiichi Endo, Yoshinobu Higami, Shinya Kobayashi:
Evaluation of Influence Exerted by a Malicious Group's Various Aims in the External Grid. ACS 2016: 112-122 - [c9]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Road-Map to Bridge Theoretical and Practical Approaches for Elevator Operations. IIAI-AAI 2016: 1097-1102 - 2015
- [c8]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Giving formal roles to elevators for breaking symmetry in static elevator operation problems. GCCE 2015: 621-625 - 2014
- [c7]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Decreasing computational times for solving static elevator operation problems by assuming maximum waiting times. GCCE 2014: 593-596 - [c6]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
A call-based integer programming model for static elevator operation problems. SCIS&ISIS 2014: 365-369 - 2013
- [c5]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Injecting speculation on ideal trajectories into a trip-based integer programming model for elevator operations. GCCE 2013: 23-27 - [c4]Tsutomu Inamoto, Yoshinobu Higami, Shin-ya Kobayashi:
Intermittently Proving Dynamic Programming to Solve Infinite MDPs on GPUs. CANDAR 2013: 252-256 - 2012
- [c3]Tsutomu Inamoto, Chikara Ohta, Hisashi Tamaki:
Gradually resolving procedures by a trip-based integer programming to optimize elevator operations. SCIS&ISIS 2012: 626-632 - [c2]Takuya Matsumoto, Tsutomu Inamoto, Hisashi Tamaki:
Mathematical programming model concerning city and urban traffic. SCIS&ISIS 2012: 867-872 - 2009
- [c1]Takuya Matsumoto, Hisashi Tamaki, Tsutomu Inamoto:
Mathematical Programming Model and Experiment of City and Urban Traffic System. ETFA 2009: 1-8
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:04 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:
