Results 221 to 230 of about 4,046,500 (265)
Some of the next articles are maybe not open access.
Quality Technology & Quantitative Management
In this paper, we propose a new method for computing the sojourn times in the MAP/M/1 queueing systems with three types of negative customers due to three basic removal rules: the RCH, RCE and RCA.
Heng-Li Liu, Quan-Lin Li
semanticscholar +1 more source
In this paper, we propose a new method for computing the sojourn times in the MAP/M/1 queueing systems with three types of negative customers due to three basic removal rules: the RCH, RCE and RCA.
Heng-Li Liu, Quan-Lin Li
semanticscholar +1 more source
Interpolation Approximations of Sojourn Time Distributions
Operations Research, 1991We present a method for approximating sojourn time distributions in open queueing systems based on light and heavy traffic limits. The method is consistent with and generalizes the interpolation approximations for moments previously presented by M. I. Reiman and B. Simon.
Philip J. Fleming, Burton Simon
openaire +1 more source
Sojourn times in closed queueing networks
Advances in Applied Probability, 1983This paper obtains the stationary joint distribution of a customer's sojourn times along an overtake-free path in a closed multiclass Jackson network. The distribution has a simple representation in terms of the product form distribution for the state of the network at an arrival instant.
Kelly, FP, Pollett, PK
openaire +5 more sources
Sojourn Time Distribution in Fluid Queues
2019We consider a fluid flow model with infinite buffer. We compute the Laplace-Stieltjes transform of the sojourn time proceeding in two steps. We first compute the stationary distribution of the buffer at arrival instants, using a change of clock. Secondly, we compute the transform of the time spent to empty the buffer. Numerical examples of sojourn time
Eleonora Deiana +2 more
openaire +2 more sources
Theory of Probability & Its Applications, 1958
Let $\{ \xi (t),0 \leqq t < \infty \} $ be a probability process such that the variable $\xi (t)$ takes on the two values 0 and 1. Let $\xi _1 ,\eta _1 ,\xi _2 ,\eta _2 , \cdots $ be the intervals of time, passed successively in states 0 and 1.
openaire +1 more source
Let $\{ \xi (t),0 \leqq t < \infty \} $ be a probability process such that the variable $\xi (t)$ takes on the two values 0 and 1. Let $\xi _1 ,\eta _1 ,\xi _2 ,\eta _2 , \cdots $ be the intervals of time, passed successively in states 0 and 1.
openaire +1 more source
The Distribution of the Sojourn Time for the Brownian Excursion
Methodology And Computing In Applied Probability, 1999Let \(\{B(t ...
openaire +2 more sources
Sojourn times in queueing networks [PDF]
, 1989 From a customer's point of view, the most important performance measure in a queueing network is his sojourn time. This paper presents a survey of sojourn time results in queueing networks. Particular attention is paid to product-form networks, for which
Boxma, O.J., Daduna, H.
openaire +2 more sources
Estimating sojourn time and sensitivity of screening for ovarian cancer using a Bayesian framework.
Journal of the National Cancer InstituteBACKGROUND Ovarian cancer is among the leading causes of gynecologic cancer-related death. Past ovarian cancer screening trials using combination of cancer antigen 125 testing and transvaginal ultrasound failed to yield statistically significant ...
S. Ishizawa +7 more
semanticscholar +1 more source
IEEE Internet of Things Journal
The prediction of the remaining useful life (RUL) of equipment is a pivotal function in realizing industrial intelligence within the industrial Internet of Things (IIoT).
Xin Li +5 more
semanticscholar +1 more source
The prediction of the remaining useful life (RUL) of equipment is a pivotal function in realizing industrial intelligence within the industrial Internet of Things (IIoT).
Xin Li +5 more
semanticscholar +1 more source
Sojourn time approximations in queueing networks with feedback
Performance Evaluation, 2006This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS ...
B.M.M. Gijsen +4 more
openaire +5 more sources