Seguir
James J. Kim
James J. Kim
Royal Canadian Air Force
Dirección de correo verificada de rmc.ca - Página principal
Título
Citado por
Citado por
Año
Analytically elegant and computationally efficient results in terms of roots for the queueing system
ML Chaudhry, JJ Kim
Queueing Systems 82, 237-257, 2016
192016
Analytically Simple and Computationally Efficient Results for the GIX/Geo/c Queues
ML Chaudhry, JJ Kim, AD Banik
Journal of Probability and Statistics 2019 (1), 6480139, 2019
72019
A novel way of treating the finite-buffer queue GI/M/c/N using roots
JJ Kim, ML Chaudhry
International Journal of Mathematical Models and Methods in Applied Sciences 11, 2017
52017
New and extended results in renewal and queueing theories
J Kim
52016
Analytically simple and computationally efficient solution to GIX/Geom/1 queues involving heavy-tailed distributions
ML Chaudhry, JJ Kim
Operations Research Letters 44 (5), 655-657, 2016
42016
Difference equations approach for multi-server queueing models with removable servers
JJ Kim, DG Down, M Chaudhry, AD Banik
Methodology and Computing in Applied Probability 24 (3), 1297-1321, 2022
22022
A Unified Approach to Multi-Server Bulk-Arrival Queues Using Roots
J Kim
22018
A Note on the Waiting‐Time Distribution in an Infinite‐Buffer GI[X]/CMSP/1 Queueing System
AD Banik, ML Chaudhry, JJ Kim
Journal of Probability and Statistics 2018 (1), 7462439, 2018
22018
A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots
JJ Kim, ML Chaudhry, V Goswami, AD Banik
Methodology and Computing in Applied Probability 23, 273-289, 2021
12021
Using a System-Theoretic Approach for Cyber Mission Assurance of the Royal Canadian Air Force Over the Horizon Radar System
JJ Kim
Massachusetts Institute of Technology, 2023
2023
Asymptotic Results for the First and Second Moments and Numerical Computations in Discrete-Time Bulk-Renewal Process
A Mansur, JJ Kim, ML Chaudhry
Yugoslav Journal of Operations Research 29 (1), 135-144, 2018
2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–11