How hard are steady-state queueing simulations? (Q4635230)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How hard are steady-state queueing simulations? |
scientific article; zbMATH DE number 6860025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How hard are steady-state queueing simulations? |
scientific article; zbMATH DE number 6860025 |
Statements
How Hard are Steady-State Queueing Simulations? (English)
0 references
16 April 2018
0 references
diffusion approximations
0 references
Markovian queues
0 references
asymptotic variance
0 references
0.8611726760864258
0 references
0.8314735889434814
0 references
0.8238454461097717
0 references
0.8128608465194702
0 references
0.8122016191482544
0 references
