default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn F. Shortle
Person information
- affiliation: George Mason University, Fairfax VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Seungwon Noh
, John Shortle:
Dynamic Event Trees for Aircraft Collision Risk Assessment. IEEE Trans. Reliab. 72(3): 1232-1242 (2023)- 2021
- [c14]Azin Zare-Noghabi, John Shortle:
Capacity Analysis for a Flow Corridor with Dynamic Wake Separation. WSC 2021: 1-11
2010 – 2019
- 2019
- [j14]Yue Liu, Giulia Pedrielli, Haobin Li, Loo Hay Lee, Chun-Hung Chen, John F. Shortle:
Optimal Computing Budget Allocation for Stochastic N-k Problem in the Power Grid System. IEEE Trans. Reliab. 68(3): 778-789 (2019) - 2017
- [j13]Matthew G. Tuck, Farrokh Alemi, John F. Shortle, Sanja Avramovic, Charles Hesdorffer:
A Comprehensive Index for Predicting Risk of Anemia from Patients' Diagnoses. Big Data 5(1): 42-52 (2017) - [c13]Azin Zare-Noghabi, John F. Shortle:
Rare event simulation for potential wake encounters. WSC 2017: 2554-2565 - 2015
- [j12]Yimin Zhang, John Shortle, Lance Sherry:
Methodology for collision risk assessment of an airspace flow corridor concept. Reliab. Eng. Syst. Saf. 142: 444-455 (2015) - 2014
- [j11]John Shortle, Yimin Zhang:
Safety Comparison of Centralized and Distributed Aircraft Separation Assurance Concepts. IEEE Trans. Reliab. 63(1): 259-269 (2014) - 2013
- [c12]John Shortle, Chun-Hung Chen:
Sensitivity analysis of rare-event splitting applied to cascading blackout models. WSC 2013: 745-754 - 2011
- [c11]Denise M. Bevilacqua Masi, Martin J. Fischer, John F. Shortle, Chun-Hung Chen:
Simulating network cyber attacks using splitting techniques. WSC 2011: 3217-3228 - [c10]Ben Crain, Chun-Hung Chen, John F. Shortle:
Combining simulation allocation and optimal splitting for rare-event simulation optimization. WSC 2011: 4003-4012 - 2010
- [j10]John F. Shortle, Martin J. Fischer:
Approximation for a two-class weighted fair queueing discipline. Perform. Evaluation 67(10): 946-958 (2010) - [c9]Martin J. Fischer, Denise M. Bevilacqua Masi, John F. Shortle, Chun-Hung Chen:
Simulating non-stationary congestion systems using splitting with applications to cyber security. WSC 2010: 2865-2875
2000 – 2009
- 2009
- [j9]John F. Shortle, Brian L. Mark, Donald Gross:
Reduction of closed queueing networks for efficient simulation. ACM Trans. Model. Comput. Simul. 19(3): 10:1-10:22 (2009) - 2008
- [b1]Donald Gross, John F. Shortle, James M. Thompson, Carl M. Harris:
Fundamentals of Queueing Theory, Fourth Edition. Wiley Series in Probability and Statistics, Wiley 2008, ISBN 978-0-47179127-0, pp. 1-509 - [c8]Martin J. Fischer, Denise M. Bevilacqua Masi, John F. Shortle:
Approximating Low Latency Queueing Buffer Latency. AICT 2008: 188-194 - [c7]John F. Shortle, Chun-Hung Chen:
A preliminary study of optimal splitting for rare-event simulation. WSC 2008: 266-272 - [c6]Martin J. Fischer, Denise M. Bevilacqua Masi, John Shortle:
Simulating the performance of a Class-Based Weighted Fair Queueing system. WSC 2008: 2901-2908 - 2007
- [j8]John F. Shortle, Martin J. Fischer, Percy H. Brill:
Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion. INFORMS J. Comput. 19(1): 112-120 (2007) - [e1]Shane G. Henderson, Bahar Biller, Ming-Hua Hsieh, John Shortle, Jeffrey D. Tew, Russell R. Barton:
Proceedings of the Winter Simulation Conference, WSC 2007, Washington, DC, USA, December 9-12, 2007. WSC 2007, ISBN 1-4244-1306-0 [contents] - 2006
- [j7]John F. Shortle, Max B. Mendel:
A generalized framework for probabilistic design with application to rotors. IEEE Trans. Reliab. 55(1): 44-52 (2006) - 2005
- [j6]John Shortle, Percy H. Brill:
Analytical Distribution of Waiting Time in the M/{iD}/1 Queue. Queueing Syst. Theory Appl. 50(2-3): 185-197 (2005) - 2004
- [j5]John Shortle, Percy H. Brill, Martin J. Fischer, Donald Gross, Denise M. Bevilacqua Masi:
An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue. INFORMS J. Comput. 16(2): 152-161 (2004) - [j4]John Shortle:
An Equivalent Random Method with hyper-exponential service. Perform. Evaluation 57(3): 409-422 (2004) - [j3]John F. Shortle, Yue Xie, C. H. Chen, George L. Donohue:
Simulating Collision Probabilities of Landing Airplanes at Nontowered Airports. Simul. 80(1): 21-31 (2004) - [c5]Yue Xie, John Shortle, George L. Donohue:
Airport Terminal-Approach Safety and Capacity Analysis Using an Agent-Based Model. WSC 2004: 1349-1357 - 2003
- [j2]John F. Shortle:
Dynamic call-blocking algorithms for telecommunications networks. IEEE Trans. Commun. 51(5): 741-747 (2003) - [c4]John Shortle, Donald Gross, Brian L. Mark:
Simulation of large networks: efficient simulation of the National Airspace System. WSC 2003: 441-448 - 2002
- [c3]Donald Gross, John Shortle, Martin J. Fischer, Denise M. Bevilacqua Masi:
Simulation input analysis: difficulties in simulating queues with Pareto service. WSC 2002: 407-415 - [c2]John C. Sees Jr., John Shortle:
Difficult queuing simulation problems: simulating M/G/1 queues with heavy-tailed service. WSC 2002: 433-438 - 2001
- [j1]John F. Shortle, Dennis C. Dietz, Paul A. Katz, Craig B. Williamson, James R. Koehler, Amie J. Elcan:
Special Section: Wagner Prize Paper: Optimal Design of a Data-Offload Network. Interfaces 31(5): 4-12 (2001) - [c1]Martin J. Fischer, Denise M. Bevilacqua Masi, Donald Gross, John Shortle, Percy H. Brill:
Using quantile estimates in simulating internet queues with Pareto service times. WSC 2001: 477-485
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-10-07 22:12 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:
