Pages that link to "Item:Q3802575"
From MaRDI portal
The following pages link to A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms (Q3802575):
Displaying 11 items.
- Queue length distributions from probability generating functions via discrete Fourier transforms (Q1119293) (← links)
- Tail uncertainty analysis in complex systems (Q1127345) (← links)
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach (Q1183674) (← links)
- Transient and busy period analysis of the GI/G/1 queue: The method of stages (Q1183679) (← links)
- The Fourier-series method for inverting transforms of probability distributions (Q1183689) (← links)
- Stochastic models of space priority mechanisms with Markovian arrival processes (Q1197763) (← links)
- Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls (Q1197770) (← links)
- A comparison of three random disciplines (Q1342955) (← links)
- Computation of tail probabilities via extrapolation methods and connection with rational and Padé approximants (Q2882803) (← links)
- Approximation of Tail Probabilities Using the<i>G</i><sub><i>n</i></sub>-Transform (Q4454178) (← links)
- An Efficient Algorithm for the Computation of the UTD $T$ Transition Function (Q5352306) (← links)
