The following pages link to Ward Whitt (Q169001):
Displaying 50 items.
- Approximations of Dynamic Programs, II (Q4196266) (← links)
- Ordinary CLT and WLLN Versions of <i>L</i> = λ<i>W</i> (Q4203981) (← links)
- On reinforcement-depletion compartmental urn models (Q4206161) (← links)
- Modeling service–time distributions with non–exponential tails:beta mixtures of exponentials (Q4248820) (← links)
- Linear stochastic fluid networks (Q4261302) (← links)
- The Physics of the Mt/G/∞ Queue (Q4272896) (← links)
- Large Fluctuations in a Deterministic Multiclass Network of Queues (Q4276608) (← links)
- Asymptotics for steady-state tail probabilities in structured markov queueing models (Q4288003) (← links)
- The transient BMAP/G/l queue (Q4288004) (← links)
- Heavy-traffic asymptotic expansions for the asymptotic decay rates in the<i>BMAP/G/</i>1 queue (Q4291650) (← links)
- Unstable Asymptotics for Nonstationary Queues (Q4302589) (← links)
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue (Q4309029) (← links)
- Transient Behavior of the M/G/1 Workload Process (Q4319763) (← links)
- Computing distributions and moments in polling models by numerical transform inversion (Q4332072) (← links)
- Portfolio choice and the Bayesian Kelly criterion (Q4332214) (← links)
- Exponential Approximations for Tail Probabilities in Queues II: Sojourn Time and Workload (Q4345595) (← links)
- Stationary-Process Approximations for the Nonstationary Erlang Loss Model (Q4346348) (← links)
- Probabilistic Scaling for the Numerical Inversion of Nonprobability Transforms (Q4354938) (← links)
- Server Staffing to Meet Time-Varying Demand (Q4363601) (← links)
- On the Laguerre Method for Numerically Inverting Laplace Transforms (Q4367056) (← links)
- Numerical Solution of Piecewise-Stationary <i>M</i><sub><i>t</i></sub>/<i>G</i><sub><i>t</i></sub>/1 Queues (Q4367237) (← links)
- A Source traffic model and its transient analysis for network control (Q4385210) (← links)
- Calculating transient characteristics of the erlang loss model by numerical transform inversion (Q4393923) (← links)
- The continuity of queues (Q4404234) (← links)
- Computing Laplace Transforms for Numerical Inversion Via Continued Fractions (Q4427383) (← links)
- (Q4538148) (← links)
- Variance Reduction in Simulations of Loss Models (Q4545663) (← links)
- Exploiting regenerative structure to estimate finite time averages via simulation (Q4565381) (← links)
- Simulation run lengths to estimate blocking probabilities (Q4575327) (← links)
- Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process (Q4632820) (← links)
- Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue (Q4632870) (← links)
- Approximations for heavily loaded <i>G/GI/n</i> + <i>GI</i> queues (Q4632918) (← links)
- Many‐server loss models with non‐poisson time‐varying arrivals (Q4632967) (← links)
- A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues (Q4731947) (← links)
- Planning Queueing Simulations (Q4733217) (← links)
- Workload bounds in fluid models with priorities (Q4779273) (← links)
- Numerical Inversion of Laplace Transforms of Probability Distributions (Q4835447) (← links)
- Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times (Q4868809) (← links)
- An operational calculus for probability distributions via Laplace transforms (Q4877462) (← links)
- (Q4878850) (← links)
- Stochastic limit laws for schedule makespans (Q4883748) (← links)
- Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model (Q4896415) (← links)
- Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals (Q4909122) (← links)
- INFINITE-SERVER QUEUES WITH BATCH ARRIVALS AND DEPENDENT SERVICE TIMES—CORRIGENDUM (Q4911125) (← links)
- (Q4945034) (← links)
- (Q4945342) (← links)
- Functional Large Deviation Principles for Waiting and Departure Processes (Q4950730) (← links)
- Partitioning Customers into Service Groups (Q4950973) (← links)
- Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues (Q4969317) (← links)
- Periodic Little’s Law (Q4971594) (← links)
