default search action
Naoto Kaio
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j10]Toshikazu Uemura, Tadashi Dohi, Naoto Kaio:
Availability Analysis of an Intrusion Tolerant Distributed Server System With Preventive Maintenance. IEEE Trans. Reliab. 59(1): 18-29 (2010) - [c11]Toshikazu Uemura, Tadashi Dohi, Naoto Kaio:
Availability Analysis of an IMS-Based VoIP Network System. ICCSA (4) 2010: 441-456 - [c10]Akikazu Izumi, Tadashi Dohi, Naoto Kaio:
Deadlock Detection Scheduling for Distributed Processes in the Presence of System Failures. PRDC 2010: 133-140
2000 – 2009
- 2009
- [j9]Tatsuya Ozaki, Tadashi Dohi, Naoto Kaio:
Numerical computation algorithms for sequential checkpoint placement. Perform. Evaluation 66(6): 311-326 (2009) - [c9]Toshikazu Uemura, Tadashi Dohi, Naoto Kaio:
Availability Analysis of a Scalable Intrusion Tolerant Architecture with Two Detection Modes. CloudCom 2009: 178-189 - 2008
- [j8]Kazuki Iwamoto, Tadashi Dohi, Naoto Kaio:
Discrete Repair-Cost Limit Replacement Policies with/without Imperfect Repair. Asia Pac. J. Oper. Res. 25(6): 735-751 (2008) - [j7]Kazuki Iwamoto, Tadashi Dohi, Naoto Kaio:
Estimating Periodic Software Rejuvenation Schedules under Discrete-Time Operation Circumstance. IEICE Trans. Inf. Syst. 91-D(1): 23-31 (2008) - 2006
- [j6]Kazuki Iwamoto, Tadashi Dohi, Hiroyuki Okamura, Naoto Kaio:
Discrete-time cost analysis for a telecommunication billing application with rejuvenation. Comput. Math. Appl. 51(2): 335-344 (2006) - [j5]Tadashi Dohi, Akira Ashioka, Naoto Kaio, Shunji Osaki:
Statistical estimation algorithms for repairs-time limit replacement scheduling under earning rate criteria. Comput. Math. Appl. 51(2): 345-356 (2006) - [j4]B. C. Giri, Tadashi Dohi, Naoto Kaio:
Discrete-time spare ordering policy with randomized lead times and discounting. Int. Trans. Oper. Res. 13(6): 561-576 (2006) - [j3]Tatsuya Ozaki, Tadashi Dohi, Hiroyuki Okamura, Naoto Kaio:
Distribution-Free Checkpoint Placement Algorithms Based on Min-Max Principle. IEEE Trans. Dependable Secur. Comput. 3(2): 130-140 (2006) - [c8]Tadashi Dohi, Tatsuya Ozaki, Naoto Kaio:
Optimal Checkpoint Placement with Equality Constraints. DASC 2006: 77-84 - 2005
- [c7]Kazuki Iwamoto, Tadashi Dohi, Naoto Kaio:
Monitoring the Health Condition of a Ubiquitous System: Rejuvenation vs. Recovery. EUC Workshops 2005: 1283-1292 - 2004
- [c6]Tatsuya Ozaki, Tadashi Dohi, Hiroyuki Okamura, Naoto Kaio:
Min-Max Checkpoint Placement under Incomplete Failure Information. DSN 2004: 721-730 - [c5]Kazuki Iwamoto, Tadashi Dohi, Naoto Kaio:
A discrete software cost model with periodic rejuvenation for a telecommunication billing application. IASTED Conf. on Software Engineering and Applications 2004: 282-287 - 2003
- [c4]Hiroyuki Suzuki, Tadashi Dohi, Naoto Kaio, Kishor S. Trivedi:
Maximizing Interval Reliability in Operational Software System with Rejuvenation. ISSRE 2003: 479-490 - 2002
- [c3]Tadashi Dohi, Kazuki Iwamoto, Hiroyuki Okamura, Naoto Kaio:
Discrete Availability Models to Rejuvenate a Telecommunication Billing Application. HASE 2002: 159-166 - [c2]Tadashi Dohi, Naoto Kaio, Kishor S. Trivedi:
Availability Models with Age-Dependent Checkpointing. SRDS 2002: 130-139 - 2001
- [j2]Tadashi Dohi, F. S. Othman, Naoto Kaio, Shunji Osaki:
The Lorenz Transform approach to the Optimal Repair-Cost limit remplacement Policy with Imperfect Repair. RAIRO Oper. Res. 35(1): 21-36 (2001)
1990 – 1999
- 1999
- [c1]Tadashi Dohi, Shunji Osaki, Naoto Kaio:
Optimal Checkpointing and Rollback Strategies with Media Failures: Statistical Estimation Algorithms. PRDC 1999: 161-
1980 – 1989
- 1989
- [j1]Ushio Sumita, Naoto Kaio, Paulo B. Góes:
Analysis of Effective Service Time with Age Dependent Interruptions and Its Application to Optimal Rollback Policy for Database Management. Queueing Syst. Theory Appl. 4(3): 193-212 (1989)
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 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint