default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeslie D. Servi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j27]Erman Çakit
, Waldemar Karwowski, Les Servi:
Application of soft computing techniques for estimating emotional states expressed in Twitter® time series data. Neural Comput. Appl. 32(8): 3535-3548 (2020)- 2019
- [j26]Douglas S. Altner, Erica K. Mason, Leslie D. Servi:
Two-stage stochastic days-off scheduling of multi-skilled analysts with training options. J. Comb. Optim. 38(1): 111-129 (2019) - 2018
- [j25]Douglas S. Altner, Anthony C. Rojas, Leslie D. Servi:
A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options. J. Sched. 21(5): 517-531 (2018) - 2017
- [j24]L. D. Servi, Paul R. Garvey:
Deriving Global Criticality Conditions from Local Dependencies Using Functional Dependency Network Analysis (FDNA). Syst. Eng. 20(4): 297-306 (2017) - 2014
- [j23]Les Servi, Sara Beth Elson:
A Mathematical Approach to Gauging Influence by Identifying Shifts in the Emotions of Social Media Users. IEEE Trans. Comput. Soc. Syst. 1(4): 180-190 (2014) - 2013
- [j22]L. D. Servi:
Analyzing social media data having discontinuous underlying dynamics. Oper. Res. Lett. 41(6): 581-585 (2013) - [j21]Paul R. Garvey, Richard A. Moynihan, Les Servi:
A macro method for measuring economic-benefit returns on cybersecurity investments: The table top approach. Syst. Eng. 16(3): 313-328 (2013) - 2004
- [j20]Daryl J. Daley, Leslie D. Servi:
Loss probabilities of hand-in traffic under various protocols: II. Model comparisons. Perform. Evaluation 55(3-4): 231-249 (2004) - [j19]Leslie D. Servi, Richard Stong:
A Disguised Half-Angle Iteration: 10973. Am. Math. Mon. 111(7): 627-628 (2004) - 2003
- [j18]Leslie D. Servi:
Nested Square Roots of 2. Am. Math. Mon. 110(4): 326-330 (2003) - 2002
- [j17]Leslie D. Servi, Steven G. Finn:
M/M/1 queues with working vacations (M/M/1/WV). Perform. Evaluation 50(1): 41-52 (2002) - [j16]Leslie D. Servi:
Problem 10973. Am. Math. Mon. 109(9): 854 (2002) - [j15]Daryl J. Daley, Leslie D. Servi:
Loss Probabilities of Hand-in Traffic under Various Protocols, I: Models and Algebraic Results. Telecommun. Syst. 19(2): 209-226 (2002) - [j14]Leslie D. Servi:
Algorithmic Solutions to Two-Dimensional Birth-Death Processes with Application to Capacity Planning. Telecommun. Syst. 21(2): 205-212 (2002) - 1997
- [j13]Daryl J. Daley, Leslie D. Servi:
Estimating Waiting Times from Transactional Data. INFORMS J. Comput. 9(2): 224-229 (1997) - 1993
- [j12]Julian Keilson, Leslie D. Servi:
The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems. Queueing Syst. Theory Appl. 14(1-2): 111-123 (1993) - 1992
- [j11]Dimitris J. Bertsimas, L. D. Servi:
Deducing Queueing from Transactional Data: The Queue Inference Engine, Revisited. Oper. Res. 40(Supplement-2): S217-S228 (1992) - 1990
- [j10]Julian Keilson, Leslie D. Servi:
A distributed Poisson approximation for preempt-resume clocked schedules. IEEE Trans. Commun. 38(2): 192-198 (1990) - 1989
- [j9]Julian Keilson, Leslie D. Servi:
Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules. Oper. Res. 37(1): 134-140 (1989) - [j8]Julian Keilson, Leslie D. Servi:
The Preempt-Resume M/G/1 Queue with Feedback and Clocked Schedules. Perform. Evaluation 9(3): 191-208 (1989) - [j7]Leslie D. Servi, David D. Yao:
Stochastic Bounds for Queueing Systems with Limited Service Schedules. Perform. Evaluation 9(4): 247-261 (1989) - 1987
- [j6]Julian Keilson, Leslie D. Servi:
Dynamics of the M/G/1 Vacation Model. Oper. Res. 35(4): 575-582 (1987) - [j5]Les Servi:
Correction to "An Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules". IEEE J. Sel. Areas Commun. 5(3): 547 (1987) - 1986
- [j4]L. D. Servi:
D/G/1 Queues with Vacations. Oper. Res. 34(4): 619-629 (1986) - [j3]Leslie D. Servi:
Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules. IEEE J. Sel. Areas Commun. 4(6): 813-822 (1986) - 1985
- [j2]L. D. Servi:
Capacity Estimation of Cyclic Queues. IEEE Trans. Commun. 33(3): 279-282 (1985) - 1980
- [j1]Leslie D. Servi:
Electrical Networks and Resource Allocation Algorithms. IEEE Trans. Syst. Man Cybern. 10(12): 841-848 (1980)
Conference and Workshop Papers
- 2020
- [c2]Les Servi, Randy C. Paffenroth, Melanie Jutras, Deon Burchett:
Reducing Reporting Burden of Healthcare Data Using Robust Principal Component Analysis. IEEE BigData 2020: 3827-3836 - 2003
- [c1]Joseph A. Cooley, Jeremy L. Mineweaser, Leslie D. Servi, Eushiuan T. Tsung:
Software-Based Erasure Codes for Scalable Distributed Storage. IEEE Symposium on Mass Storage Systems 2003: 157-164
Informal and Other Publications
- 2018
- [i1]Randy C. Paffenroth, Kathleen Kay, Les Servi:
Robust PCA for Anomaly Detection in Cyber Networks. CoRR abs/1801.01571 (2018)
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-21 00:15 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:
