Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (Q5462811): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:01, 9 February 2024
scientific article; zbMATH DE number 2189015
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique |
scientific article; zbMATH DE number 2189015 |
Statements
Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique (English)
0 references
27 July 2005
0 references
semi-Markov process
0 references
polynomial factorization
0 references
discrete time single server system
0 references
stationary workload analysis
0 references
interval arithmetic
0 references
result verification
0 references
queuing systems
0 references
