Pages that link to "Item:Q3847306"
From MaRDI portal
The following pages link to The Probability Law of the Busy Period for Two Types of Queuing Processes (Q3847306):
Displaying 10 items.
- Lattice path combinatorics and linear probing (Q1075065) (← links)
- The busy periods of some queueing systems (Q1346153) (← links)
- Calculating the \(M/G/1\) busy-period density and LIFO waiting-time distribution by direct numerical transform inversion (Q1919174) (← links)
- A combinatorial method in the theory of Markov chains (Q2265728) (← links)
- The stochastic law of the busy period for a single-server queue with Poisson input (Q2626036) (← links)
- A transient analysis of M/G/1 queues with N-policy (Q4012968) (← links)
- On mutations in the branching model for multitype populations (Q5215014) (← links)
- The distribution of majority times in a ballot (Q5328478) (← links)
- Generalizations of the ballot problem (Q5339849) (← links)
- Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1 (Q5640552) (← links)