default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoto Miyoshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Kiichi Tokuyama
, Tatsuaki Kimura, Naoto Miyoshi:
Periodic Handover Skipping in Cellular Networks: Spatially Stochastic Modeling and Analysis. IEEE Trans. Wirel. Commun. 23(1): 91-103 (2024)- 2023
- [i10]Kiichi Tokuyama, Tatsuaki Kimura, Naoto Miyoshi:
Periodic handover skipping in cellular networks: Spatially stochastic modeling and analysis. CoRR abs/2303.07020 (2023) - 2022
- [j17]Yukang Jiang, Naoto Miyoshi:
Joint Performance Analysis of Ages of Information in a Multi-Source Pushout Server. IEEE Trans. Inf. Theory 68(2): 965-975 (2022) - [j16]Subhroshekhar Ghosh, Naoto Miyoshi, Tomoyuki Shirai:
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology. IEEE Trans. Inf. Theory 68(8): 5513-5534 (2022) - 2020
- [i9]Yukang Jiang, Naoto Miyoshi:
Joint performance analysis of ages of information in a multi-source pushout server. CoRR abs/2006.03404 (2020) - [i8]Kiichi Tokuyama, Tatsuaki Kimura, Naoto Miyoshi:
Time-based Handover Skipping in Cellular Networks: Spatially Stochastic Modeling and Analysis. CoRR abs/2008.10535 (2020) - [i7]Subhro Ghosh, Naoto Miyoshi, Tomoyuki Shirai:
Disordered complex networks: energy optimal lattices and persistent homology. CoRR abs/2009.08811 (2020)
2010 – 2019
- 2019
- [j15]Chiranjib Saha, Harpreet S. Dhillon, Naoto Miyoshi, Jeffrey G. Andrews:
Unified Analysis of HetNets Using Poisson Cluster Processes Under Max-Power Association. IEEE Trans. Wirel. Commun. 18(8): 3797-3812 (2019) - [j14]Naoto Miyoshi:
Downlink Coverage Probability in Cellular Networks With Poisson-Poisson Cluster Deployed Base Stations. IEEE Wirel. Commun. Lett. 8(1): 5-8 (2019) - 2018
- [j13]Yuta Takahashi, Yao Chen, Takuya Kobayashi, Naoto Miyoshi:
Simple and Fast PPP-Based Approximation of SIR Distributions in Downlink Cellular Networks. IEEE Wirel. Commun. Lett. 7(6): 898-901 (2018) - [c11]Kiichi Tokuyama, Naoto Miyoshi:
Data rate and handoff rate analysis for user mobility in cellular networks. WCNC 2018: 1-6 - [i6]Naoto Miyoshi:
Downlink coverage probability in cellular networks with Poisson-Poisson cluster deployed base stations. CoRR abs/1803.06172 (2018) - [i5]Chiranjib Saha, Harpreet S. Dhillon, Naoto Miyoshi, Jeffrey G. Andrews:
Unified Analysis of HetNets using Poisson Cluster Process under Max-Power Association. CoRR abs/1812.01830 (2018) - 2017
- [j12]Fumio Machida, Naoto Miyoshi:
Analysis of an optimal stopping problem for software rejuvenation in a deteriorating job processing system. Reliab. Eng. Syst. Saf. 168: 128-135 (2017) - [i4]Naoto Miyoshi, Tomoyuki Shirai:
Tail asymptotics of signal-to-interference ratio distribution in spatial cellular network models. CoRR abs/1703.05024 (2017) - 2016
- [j11]Naoto Miyoshi, Tomoyuki Shirai:
Spatial Modeling and Analysis of Cellular Networks Using the Ginibre Point Process: A Tutorial. IEICE Trans. Commun. 99-B(11): 2247-2255 (2016) - [c10]Takuya Kobayashi, Naoto Miyoshi:
Downlink coverage probability in Ginibre-poisson overlaid MIMO cellular networks. WiOpt 2016: 369-376 - [c9]Naoto Miyoshi, Tomoyuki Shirai:
A sufficient condition for tail asymptotics of SIR distribution in downlink cellular networks. WiOpt 2016: 454-460 - [i3]Naoto Miyoshi, Tomoyuki Shirai:
A sufficient condition for the tail asymptotics of SIR distribution in downlink cellular networks. CoRR abs/1602.00844 (2016) - [i2]Naoto Miyoshi, Tomoyuki Shirai:
Spatial modeling and analysis of cellular networks using the Ginibre point process: A tutorial. CoRR abs/1606.02828 (2016) - 2015
- [c8]Fumio Machida, Naoto Miyoshi:
An optimal stopping problem for software rejuvenation in a job processing system. ISSRE Workshops 2015: 139-143 - [c7]Naoto Miyoshi, Tomoyuki Shirai:
Downlink coverage probability in a cellular network with Ginibre deployed base stations and Nakagami-m fading channels. WiOpt 2015: 483-489 - [i1]Naoto Miyoshi, Tomoyuki Shirai:
Downlink Coverage Probability in a Cellular Network with Ginibre Deployed Base Stations and Nakagami-m Fading Channels. CoRR abs/1503.05377 (2015) - 2014
- [j10]Itaru Nakata, Naoto Miyoshi:
Spatial stochastic models for analysis of heterogeneous cellular networks with repulsively deployed base stations. Perform. Evaluation 78: 7-17 (2014) - [c6]Takuya Kobayashi, Naoto Miyoshi:
Uplink cellular network models with Ginibre deployed base stations. ITC 2014: 1-7 - [c5]Hitoshi Nagamatsu, Naoto Miyoshi, Tomoyuki Shirai:
Padé approximation for coverage probability in cellular networks. WiOpt 2014: 693-700 - 2012
- [j9]Naoki Tsukada, Ryo Hirade, Naoto Miyoshi:
Fluid limit analysis of FIFO and RR caching for independent reference models. Perform. Evaluation 69(9): 403-412 (2012)
2000 – 2009
- 2009
- [j8]Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
Scale free interval graphs. Theor. Comput. Sci. 410(45): 4588-4600 (2009) - 2008
- [j7]Masaki Aida, Naoto Miyoshi, Keisuke Ishibashi:
A Change-of-Measure Approach to Per- Flow Delay Measurement Combining Passive and Active Methods: Mathematical Formulation for CoMPACT Monitor. IEEE Trans. Inf. Theory 54(11): 4966-4979 (2008) - [c4]Naoto Miyoshi, Takeya Shigezumi, Ryuhei Uehara, Osamu Watanabe:
Scale Free Interval Graphs. AAIM 2008: 292-303 - 2006
- [j6]Toyoaki Sugimoto, Naoto Miyoshi:
On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution. Random Struct. Algorithms 29(3): 296-323 (2006) - 2004
- [j5]Shinya Sano, Naoto Miyoshi, Ryohei Kataoka:
m-Balanced words: A generalization of balanced words. Theor. Comput. Sci. 314(1-2): 97-120 (2004) - 2003
- [c3]Masaki Aida, Naoto Miyoshi, Keisuke Ishibashi:
A scalable and lightweight QoS monitoring technique combining passive and active approaches: On the mathematical formulation of CoMPACT Monitor. INFOCOM 2003: 125-133 - 2002
- [j4]Naoto Miyoshi, Fumio Ishizaki:
A Unified Approach to the Proportional Relation for Discrete-Time Single-Server Queues Naoto Miyoshi, Fumio Ishizaki. Queueing Syst. Theory Appl. 42(2): 201-212 (2002)
1990 – 1999
- 1999
- [c2]Takayuki Tagaki, Naoto Miyoshi:
On the implementation of a smoothed perturbation analysis estimator for a single-server queue with multiple vacations. WSC 1999: 435-441 - 1997
- [j3]Naoto Miyoshi:
Smoothed Perturbation Analysis for Stationary Single-Server Queues with Multiple Customer Classes. Discret. Event Dyn. Syst. 7(3): 275-293 (1997) - [c1]Yoshihiro Yamada, Naoto Miyoshi, Toshiharu Hasegawa:
Sensitivity Analysis of the Loss Probability in a Stationary Gradual Queue for High-Speed Networks. INFOCOM 1997: 1114-1121 - 1996
- [j2]Naoto Miyoshi, Toshiharu Hasegawa:
On-line derivative estimation for the multiclass single-server priority queue using perturbation analysis. IEEE Trans. Autom. Control. 41(2): 300-305 (1996) - 1993
- [j1]Naoto Miyoshi, Masamitsu Ohnishi, Norio Okino:
Optimal service control of a station connected with two parallel substations. IEEE Trans. Autom. Control. 38(10): 1567-1572 (1993)
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-20 22:59 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:
