標題: Titlebook: Applied Probability— Computer Science: The Interface; Ralph L. Disney,Teunis J. Ott Book 1982 Springer Science+Business Media New York 198 [打印本頁] 作者: 減輕 時間: 2025-3-21 18:07
書目名稱Applied Probability— Computer Science: The Interface影響因子(影響力)
書目名稱Applied Probability— Computer Science: The Interface影響因子(影響力)學科排名
書目名稱Applied Probability— Computer Science: The Interface網(wǎng)絡公開度
書目名稱Applied Probability— Computer Science: The Interface網(wǎng)絡公開度學科排名
書目名稱Applied Probability— Computer Science: The Interface被引頻次
書目名稱Applied Probability— Computer Science: The Interface被引頻次學科排名
書目名稱Applied Probability— Computer Science: The Interface年度引用
書目名稱Applied Probability— Computer Science: The Interface年度引用學科排名
書目名稱Applied Probability— Computer Science: The Interface讀者反饋
書目名稱Applied Probability— Computer Science: The Interface讀者反饋學科排名
作者: 開始發(fā)作 時間: 2025-3-21 23:10
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 時間: 2025-3-22 00:38 作者: 事物的方面 時間: 2025-3-22 06:52 作者: 顧客 時間: 2025-3-22 09:54
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作者: 雜色 時間: 2025-3-22 15:36
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 時間: 2025-3-22 19:50 作者: 極端的正確性 時間: 2025-3-23 00:35
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 時間: 2025-3-23 02:23
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作者: 傳染 時間: 2025-3-23 08:10
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作者: Lumbar-Spine 時間: 2025-3-23 10:10
Linear Probing and Related Problemsrds are performed using linear probing: when a record is hashed into a full bucket, the file is scanned sequentially (in a cyclic manner) until a non-full bucket is found. The problem is related to some versions of an applied probability model which arises in economics (analysis of a decentralized m作者: 泥瓦匠 時間: 2025-3-23 17:33 作者: 酷熱 時間: 2025-3-23 21:33 作者: insular 時間: 2025-3-23 22:27 作者: 雪白 時間: 2025-3-24 03:20 作者: mechanical 時間: 2025-3-24 07:49
The Theory of Non-market Valuation,their arrivals. The servers are providing service whenever customers are present. The sequence of service times at server i is a sequence of independent random variables distributed exponentially with mean λ.., i = 1,..., M, and these M sequences are mutually independent.作者: Dri727 時間: 2025-3-24 11:22 作者: 樂器演奏者 時間: 2025-3-24 16:58 作者: obscurity 時間: 2025-3-24 22:08
The Time for a Round-Trip in a Cycle of Exponential Queuestheir arrivals. The servers are providing service whenever customers are present. The sequence of service times at server i is a sequence of independent random variables distributed exponentially with mean λ.., i = 1,..., M, and these M sequences are mutually independent.作者: Dungeon 時間: 2025-3-25 03:13 作者: Vldl379 時間: 2025-3-25 03:34
Steady-State Algorithmic Analysis of M/M/c Two-Priority Queues with Heterogeneous Rates the “Probabilistic puzzler” posed by D. P. Heyman in the fall 1977 issue of ., and extends a result of A. Cobham [.] to two-priority queues with unequal service rates. In addition, the probabilities of individual states are computed. The algorithm has been programmed and some examples computed for nonpreemptive systems with five servers.作者: orthodox 時間: 2025-3-25 09:32
Nick Hanley,Jason F. Shogren,Ben Whiteg time. For the output process we derive tractable and good approximations for the moments of the interdeparture time. Also we discuss extensions to the finite capacity M/G/c queue and the machine repair problem with multiple repairmen having general repair times.作者: Embolic-Stroke 時間: 2025-3-25 14:31
Francesco di Castri,Malcolm Hadleyn be used interactively in the design of such systems for arriving at desirable values of N and K. A self-contained section of numerical examples illustrates some interesting qualitative aspects of such a model.作者: Lime石灰 時間: 2025-3-25 18:56
https://doi.org/10.1007/978-1-4684-3713-3 buffer contents, assumed to exist if the total normalized arrival rate is less than one, is used to find the average buffer contents and the average intervisit time. General, independent arrival rates are assumed for the n terminals. The analysis follows that in Swartz [2].作者: Macronutrients 時間: 2025-3-25 21:47
Computational Methods for Single-Server and Multi-Server Queues with Markovian Input and General Serg time. For the output process we derive tractable and good approximations for the moments of the interdeparture time. Also we discuss extensions to the finite capacity M/G/c queue and the machine repair problem with multiple repairmen having general repair times.作者: Arthritis 時間: 2025-3-26 03:48 作者: condemn 時間: 2025-3-26 08:14
Analysis of a Scan Service Policy in a Gated Loop System buffer contents, assumed to exist if the total normalized arrival rate is less than one, is used to find the average buffer contents and the average intervisit time. General, independent arrival rates are assumed for the n terminals. The analysis follows that in Swartz [2].作者: 友好關系 時間: 2025-3-26 08:54 作者: 我正派 時間: 2025-3-26 15:51 作者: 集中營 時間: 2025-3-26 16:55 作者: 延期 時間: 2025-3-26 23:18
https://doi.org/10.1007/978-3-030-01968-6full bucket is found. The problem is related to some versions of an applied probability model which arises in economics (analysis of a decentralized market). The probabilities underlying the behavior of the addressing system are determined, and the relevant performance measures are derived.作者: immunity 時間: 2025-3-27 04:37
Environmental Education & Teacher Education through station j., etc. Both the cases of infinite waiting room and of zero waiting room between the stations are considered; in the case of zero waiting room, blocking may occur. We study how the output process depends on the sequence in which the stations are set up.作者: 欺騙手段 時間: 2025-3-27 07:48 作者: 悲觀 時間: 2025-3-27 13:17
Some Computational Aspects of Queueing Network Modelsoping efficient techniques for their solution. Currently, there does not appear to be any “best” technique. This paper surveys three well-known methods for solving queueing network models and discusses their complexity, size and numerical properties.作者: 冷峻 時間: 2025-3-27 15:04 作者: Friction 時間: 2025-3-27 20:18 作者: 好開玩笑 時間: 2025-3-28 01:02
Systems Theory and Environmental EducationThe Laguerre transform, described in detail elsewhere [A] [B], is a novel tool for mechanizing numerically the operations of convolution, differentiation, integration and polynomial multiplication required for applied probability evaluation.作者: Overdose 時間: 2025-3-28 04:59 作者: 青春期 時間: 2025-3-28 10:01 作者: outrage 時間: 2025-3-28 13:37 作者: 小故事 時間: 2025-3-28 17:45 作者: braggadocio 時間: 2025-3-28 19:42
Applied Probability— Computer Science: The Interface978-1-4612-5798-1Series ISSN 2297-0576 Series E-ISSN 2297-0584 作者: Amorous 時間: 2025-3-29 02:53
2297-0576 Overview: 978-0-8176-3093-5978-1-4612-5798-1Series ISSN 2297-0576 Series E-ISSN 2297-0584 作者: troponins 時間: 2025-3-29 03:27 作者: GULP 時間: 2025-3-29 07:23 作者: ONYM 時間: 2025-3-29 12:46 作者: 審問 時間: 2025-3-29 17:48 作者: figurine 時間: 2025-3-29 21:56
Nhi H. Tran,James A. Giesecke,Michael Jerieric keys Y. < Y.... < Y., one often wishes to find a particular record whose key equals y. Several recent papers [2,5,6,9] have shown how an algorithm called interpolation search performs this operation in log log N expected runtime when the keys in the ordered file are generated by the uniform prob作者: 吞沒 時間: 2025-3-30 03:58 作者: erythema 時間: 2025-3-30 04:21
https://doi.org/10.1007/0-306-48021-2relations between customer averages and time averages, such as L = λW (Little’s formula); (ii) relations between the stationary distribution of a process and an imbedded process; and (iii) the phenomenon of insensitivity..We compare these results to those obtained in the computer-science literature 作者: BAN 時間: 2025-3-30 10:56 作者: 取消 時間: 2025-3-30 14:37
