19 search results - page 1 / 4 » Continuity theorems for the M M 1 n queueing system |
QUESTA
2008
13 years 7 months ago
2008
ANOR
2002
13 years 7 months ago
2002
This paper provides the asymptotic analysis of the loss probability in the GI/M/1/n queueing system as n increases to infinity. The approach of this paper is alternative to that of...
CPC
2010
13 years 5 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
IJCAI
1989
13 years 8 months ago
1989
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
TIT
2008
13 years 7 months ago
2008
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...