Titlebook: Applied Probability— Computer Science: The Interface; Ralph L. Disney,Teunis J. Ott Book 1982 Springer Science+Business Media New York 198

減輕

書目名稱Applied Probability— Computer Science: The Interface影響因子(影響力)




書目名稱Applied Probability— Computer Science: The Interface影響因子(影響力)學(xué)科排名




書目名稱Applied Probability— Computer Science: The Interface網(wǎng)絡(luò)公開度




書目名稱Applied Probability— Computer Science: The Interface網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Applied Probability— Computer Science: The Interface被引頻次




書目名稱Applied Probability— Computer Science: The Interface被引頻次學(xué)科排名




書目名稱Applied Probability— Computer Science: The Interface年度引用




書目名稱Applied Probability— Computer Science: The Interface年度引用學(xué)科排名




書目名稱Applied Probability— Computer Science: The Interface讀者反饋




書目名稱Applied Probability— Computer Science: The Interface讀者反饋學(xué)科排名

開始發(fā)作

A Multivariate Statistical Model for Data Base Performance Evaluation selectivities). This paper presents a multivariate statistical model for the estimation of record selectivities. The model takes into account non-uniformity and correlations of the attribute values in the data base, as well as non-uniformity and correlations of the attribute values in queries.

instill

事物的方面

顧客

The Time for a Round-Trip in a Cycle of Exponential Queuesnd populated by an arbitrary fixed number of customers. The present paper gives the generalization of Chow’s result (by means of a different proof) to the case of arbitrarily many exponential servers..There is a string of M, M ≥ 2, single servers connected in such a way that a customer, upon departi

雜色

Some Computational Aspects of Queueing Network Modelsoperations research, their application to the study of computers has stimulated further research, both into extending the basic results and into developing efficient techniques for their solution. Currently, there does not appear to be any “best” technique. This paper surveys three well-known method

AVOW

極端的正確性

Steady-State Algorithmic Analysis of M/M/c Two-Priority Queues with Heterogeneous Ratesl analysis . Neuts which exploits a partition of the full state space into blocks. Both M/G/1 and GI/M/1 paradigm block structures arise and are exploited in the analysis. The mean number of waiting customers and the mean delay for each priority class are calculated. This gives a partial solution to

alcoholism

Exploiting Seek Overlapaviour of a central computing facility. In the case described here the disks and disk control units formed the bottleneck. However, the only allowable alterations were in core size and central processor speed. The practical solution was to use such alterations in such a way that seek overlap was exp

傳染

Analysis of a Scan Service Policy in a Gated Loop System are serviced according to a SCAN policy: the terminals are polled in sequence 1,2,3,..., n, n, n-1,...,2,1. Data are removed one unit at a time from the terminals’ buffer. Data arriving to the terminal during this time are stored in an auxilliary buffer and are served in the next poll to the termin