default search action
Michael R. Taaffe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Prasanna K. Ragavan, Susan R. Hunter, Raghu Pasupathy, Michael R. Taaffe:
Adaptive Sampling line search for local stochastic optimization with integer variables. Math. Program. 196(1): 775-804 (2022)
2010 – 2019
- 2017
- [j10]Ira Gerhardt, Barry L. Nelson, Michael R. Taaffe:
Technical Note: The MAPt/Pht/∞ Queueing System and Multiclass [MAPt/Pht/∞]K Queueing Network. INFORMS J. Comput. 29(2): 367-376 (2017) - [c6]Fatemeh Sadat Hashemi, Michael R. Taaffe:
A sequential statistics approach to dynamic staffing under demand uncertainty. WSC 2017: 956-965 - 2015
- [j9]Jin Wang, Michael R. Taaffe:
Multivariate Mixtures of Normal Distributions: Properties, Random Vector Generation, Fitting, and as Models of Market Daily Changes. INFORMS J. Comput. 27(2): 193-203 (2015) - 2013
- [j8]Walid W. Nasr, Michael R. Taaffe:
Fitting the Pht/Mt/s/c Time-Dependent Departure Process for Use in Tandem Queueing Networks. INFORMS J. Comput. 25(4): 758-773 (2013)
2000 – 2009
- 2004
- [j7]Barry L. Nelson, Michael R. Taaffe:
The Pht/Pht/infinity Queueing System: Part I - The Single Node. INFORMS J. Comput. 16(3): 266-274 (2004) - [j6]Barry L. Nelson, Michael R. Taaffe:
The [Pht/Pht/infinity]K Queueing System: Part II - The Multiclass Network. INFORMS J. Comput. 16(3): 275-283 (2004)
1990 – 1999
- 1997
- [j5]Barry L. Nelson, Bruce W. Schmeiser, Michael R. Taaffe, Jin Wang:
Approximation-assisted point estimation. Oper. Res. Lett. 20(3): 109-118 (1997) - 1994
- [j4]Bruce W. Schmeiser, Michael R. Taaffe:
Time-dependent queueing network approximations as simulation external control variates. Oper. Res. Lett. 16(1): 1-9 (1994) - 1991
- [j3]Mary A. Johnson, Michael R. Taaffe:
An Investigation of Phase-Distribution Moment-Matching Algorithms for Use in Queueing Models. Queueing Syst. Theory Appl. 8(2): 129-147 (1991) - [j2]Mary A. Johnson, Michael R. Taaffe:
A Graphical Investigation of Error Bounds for Moment-Based Queueing Approximations. Queueing Syst. Theory Appl. 8(3): 295-312 (1991) - 1990
- [c5]Edward C. Bronson, Michael R. Taaffe, Leah H. Jamieson:
A phoneme model of English speech for the design of a parallel speech understanding system. ICASSP 1990: 805-808
1980 – 1989
- 1989
- [j1]Kim L. Ong, Michael R. Taaffe:
Nonstationary Queues with Interrupted Poisson Arrivals and Unreliable/Repairable Servers. Queueing Syst. Theory Appl. 4(1): 27-46 (1989) - 1985
- [c4]Michael R. Taaffe:
How effectively do simulation conferences and publications serve their intended audience (panel)? WSC 1985: 113 - 1984
- [c3]Michael R. Taaffe, Kim L. Ong:
Approximating time-dependent non-exponential queues. WSC 1984: 174-178 - 1983
- [c2]Michael R. Taaffe, Sheryl A. Horn:
External control variance reduction for nonstationary simulation. WSC 1983: 341-344 - 1982
- [c1]Michael R. Taaffe, Gordon M. Clark:
Approximating nonstationary queueing systems. WSC 1982: 9-13
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-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint