An analysis of an approximation algorithm for queueing networks.
Derek L. EagerKenneth C. SevcikPublished in: Perform. Evaluation (1984)
Keyphrases
- queueing networks
- computational complexity
- preprocessing
- detection algorithm
- recognition algorithm
- learning algorithm
- objective function
- search space
- k means
- np hard
- probabilistic model
- cost function
- worst case
- error bounds
- polynomial time approximation
- polygonal approximation
- neural network
- closed form
- random variables
- particle swarm optimization
- special case
- optimal solution
- machine learning