Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             257 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A bandwidth reservation mechanism for prioritized multimedia integrated access with very high channel throughput in beyond 3G TDMA-based wireless networks Koutsakis, P.
2006
85-86 2 p. 61-78
18 p.
artikel
2 A bridge between preemptive and non-preemptive queueing models Machihara, Fumiaki
1995
85-86 2 p. 93-106
14 p.
artikel
3 Acceptance instant distributions in product-form closed queueing networks with blocking Zhuang, Li
1996
85-86 2 p. 133-144
12 p.
artikel
4 Accurate formulae for the loss probability evaluation in a large class of queueing systems Baiocchi, Andrea
1993
85-86 2 p. 125-132
8 p.
artikel
5 Acknowledgement to reviewers 2009
85-86 2 p. 136-137
2 p.
artikel
6 1982 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems 1983
85-86 2 p. 139-144
6 p.
artikel
7 A distributed algorithm for performance improvement through file replication, file migration and process migration Hać, Anna
1986
85-86 2 p. 167-
1 p.
artikel
8 A generalisation of Norton's theorem for multiclass queueing networks Kritzinger, P.S
1982
85-86 2 p. 98-107
10 p.
artikel
9 A generalized method of moments for closed queueing networks Casale, Giuliano
2011
85-86 2 p. 180-200
21 p.
artikel
10 A general treatment of rearrangement problems in a linear storage Arató, Mátyás
1982
85-86 2 p. 108-117
10 p.
artikel
11 Aggregation and disaggregation through insensitivity in stochastic Petri nets Henderson, W.
1993
85-86 2 p. 91-114
24 p.
artikel
12 A hybrid access method in a multiple access channel Rosberg, Zvi
1986
85-86 2 p. 93-102
10 p.
artikel
13 A matrix geometric solution to a resequencing problem Varma, Subir
1991
85-86 2 p. 103-114
12 p.
artikel
14 A model of transaction blocking in databases Galler, Bruce I.
1983
85-86 2 p. 95-122
28 p.
artikel
15 A model to predict the average response time of user programs Qin, Bin
1989
85-86 2 p. 93-101
9 p.
artikel
16 An algorithm for the optimization of nonbifurcated flows in computer communication networks Courtois, P.-J.
1981
85-86 2 p. 139-152
14 p.
artikel
17 An algorithmic approach for a special class of Markov chains arising in queuing theory 1981
85-86 2 p. 194-
1 p.
artikel
18 An alternative approach for analyzing finite buffer queues in discrete time Alfa, Attahiru Sule
2003
85-86 2 p. 75-92
18 p.
artikel
19 Analysis and optimum performance of two message-passing parallel processors synchronized by rollback Mitra, Debasis
1987
85-86 2 p. 111-124
14 p.
artikel
20 Analysis and performance evaluation of HYPERchannel access protocols Spaniol, Otto
1981
85-86 2 p. 170-179
10 p.
artikel
21 Analysis of a discrete-time queue with gated priority Ishizaki, Fumio
1995
85-86 2 p. 121-143
23 p.
artikel
22 Analysis of affinity based routing in multi-system data sharing Yu, Philip S.
1987
85-86 2 p. 87-109
23 p.
artikel
23 Analysis of a general mass storage system 1981
85-86 2 p. 192-
1 p.
artikel
24 Analysis of a multiqueue model for an ISDN access interface Ozawa, Toshihisa
1992
85-86 2 p. 65-75
11 p.
artikel
25 Analysis of discrete-time MAP/G/1 queue under workload control Lee, Se Won
2012
85-86 2 p. 71-85
15 p.
artikel
26 Analysis of ratings on trust inference in open environments Liang, Zhengqiang
2008
85-86 2 p. 99-128
30 p.
artikel
27 Analysis of SITA policies Bachmat, Eitan
2010
85-86 2 p. 102-120
19 p.
artikel
28 An analysis of symmetric polling systems with two priority classes Gianini, Jacqueline
1988
85-86 2 p. 93-115
23 p.
artikel
29 An analysis of the tree convolution algorithm for queuing networks 1981
85-86 2 p. 192-
1 p.
artikel
30 An analytical study of strategy-oriented restructuring algorithms Pâris, Jehan-François
1984
85-86 2 p. 117-132
16 p.
artikel
31 An analytic solution of the waiting time distribution for the discrete-time GI/G/1 queue Murata, Masayuki
1991
85-86 2 p. 87-95
9 p.
artikel
32 An approximate solution for computer networks with semaphores Yu-Chung Liao,
1990
85-86 2 p. 143-151
9 p.
artikel
33 An approximate transient analysis of the M(t)/M/1 queue Upton, Richard A
1982
85-86 2 p. 118-132
15 p.
artikel
34 An approximation for the mean response time for shortest queue routing with general interarrival and service times Nelson, Randolph D.
1993
85-86 2 p. 123-139
17 p.
artikel
35 An efficient technique to analyze the impact of bursty TCP traffic in wide-area networks Garetto, Michele
2008
85-86 2 p. 181-202
22 p.
artikel
36 An empirical comparison of generators for self similar simulated traffic Horn, G.
2007
85-86 2 p. 162-190
29 p.
artikel
37 An experimental assessment of resource queue lengths as load indices Zhou, S.
1987
85-86 2 p. 166-
1 p.
artikel
38 Announcement 1987
85-86 2 p. 171-172
2 p.
artikel
39 A note on the comparison between Bernoulli and limited policies in vacation models Tedijanto, T.E
1992
85-86 2 p. 89-97
9 p.
artikel
40 A novel approach for the performance bound of QoS-aware data networks under greedy CAC policy Bakhshi, Bahador
2013
85-86 2 p. 90-113
24 p.
artikel
41 A page fault equation for modeling the effect of memory size Tay, Y.C.
2006
85-86 2 p. 99-130
32 p.
artikel
42 A performance model of a connection-oriented hypercube interconnection system Chlamtac, Imrich
1996
85-86 2 p. 151-167
17 p.
artikel
43 Applied probability — Computer science, the interface 1981
85-86 2 p. 185-187
3 p.
artikel
44 Approximate analysis for heterogeneous multiprocessor systems with priority jobs Nishida, Takeshi
1992
85-86 2 p. 77-88
12 p.
artikel
45 Approximate characterisation of nonstationary discrete time G/G/1 systems Ackroyd, Martin H.
1986
85-86 2 p. 117-123
7 p.
artikel
46 Approximate solution of queuing networks with simultaneous resource possession 1981
85-86 2 p. 193-
1 p.
artikel
47 Approximating response time distributions in closed queuing network models of computer performance 1981
85-86 2 p. 193-
1 p.
artikel
48 Approximations for the per-class waiting time and interdeparture time in the Σ i GI i /GI i/1 queue Fischer, Wolfgang
1992
85-86 2 p. 65-78
14 p.
artikel
49 A probabilistic constrained nonlinear optimization framework to optimize RED parameters Patro, Rajesh Kumar
2009
85-86 2 p. 81-104
24 p.
artikel
50 A queueing system with discrete autoregressive arrivals Kim, Bara
2007
85-86 2 p. 148-161
14 p.
artikel
51 A simple approach to obtain tight upper bounds for the asymptotic queueing behavior of statistical multiplexers with heterogeneous traffic Xiong, Yijun
1995
85-86 2 p. 159-173
15 p.
artikel
52 A simple derivation of transient queue statistics and applications Tsai, Wei K.
1989
85-86 2 p. 103-114
12 p.
artikel
53 A simulation-based methodology and tool for automating the modeling and analysis of voice-over-IP perceptual quality Conway, Adrian E.
2003
85-86 2 p. 129-147
19 p.
artikel
54 A simulation study of the performances of HDLC controlled links Georges, J.
1981
85-86 2 p. 126-138
13 p.
artikel
55 A single-server queue with vacations and non-gated time-limited service Leung, Kin K.
1991
85-86 2 p. 115-125
11 p.
artikel
56 Aspects of the solution of some multiclass loss systems Brandwajn, Alexandre
1993
85-86 2 p. 141-154
14 p.
artikel
57 A study of fairness in packet-switching networks 1981
85-86 2 p. 193-
1 p.
artikel
58 A study of program restructuring in a virtual memory system Breecher, Jerry
1989
85-86 2 p. 79-92
14 p.
artikel
59 Asymptotically optimal trade-off between local and global connectivity in wireless networks Faragó, András
2011
85-86 2 p. 142-156
15 p.
artikel
60 Asymptotic analysis of memory interference in multiprocessors with private cache memories Kogan, Ya.A
1985
85-86 2 p. 97-104
8 p.
artikel
61 Asymptotic optimization of limited access queueing systems with losses Falin, Gennadi
1996
85-86 2 p. 77-93
17 p.
artikel
62 Asymptotic solution of stochastic fluid models Nabli, Hédi
2004
85-86 2 p. 121-140
20 p.
artikel
63 A trace-driven simulation study of dynamic load balancing Zhou, S.
1987
85-86 2 p. 167-
1 p.
artikel
64 A tree convolution algorithm for the solution of queuing networks 1981
85-86 2 p. 191-192
2 p.
artikel
65 A two-moment approximation for a buffer design problem requiring a small rejection probability de Kok, A.G
1985
85-86 2 p. 77-84
8 p.
artikel
66 A unified approach for analyzing persistent, non-persistent and ON–OFF TCP sessions in the Internet Gupta, Atul
2006
85-86 2 p. 79-98
20 p.
artikel
67 A unified stochastic model for the packet stream from periodic sources Latouche, Guy
1992
85-86 2 p. 103-121
19 p.
artikel
68 Blocking probabilities for multiple class batched Poisson arrivals to a shared resource Morrison, J.A.
1996
85-86 2 p. 131-150
20 p.
artikel
69 Blocking with retrials in a completely shared resource environment Kaufman, J.S
1992
85-86 2 p. 99-116
18 p.
artikel
70 Book review Akyildiz, I.F.
1989
85-86 2 p. 161-
1 p.
artikel
71 Buffer size requirements under longest queue first Gail, H.R.
1993
85-86 2 p. 133-140
8 p.
artikel
72 Calendar 1998
85-86 2 p. 145-148
4 p.
artikel
73 Calendar 1998
85-86 2 p. 123-124
2 p.
artikel
74 Calendar 1996
85-86 2 p. 155-157
3 p.
artikel
75 Calendar 1996
85-86 2 p. 169-172
4 p.
artikel
76 Calendar51 1998
85-86 2 p. 151-152
2 p.
artikel
77 Calendar 1992
85-86 2 p. 133-134
2 p.
artikel
78 Calendar97 1995
85-86 2 p. 197-198
2 p.
artikel
79 Calendar 1995
85-86 2 p. 191-192
2 p.
artikel
80 Calendar 1997
85-86 2 p. 153-154
2 p.
artikel
81 Calendar 1992
85-86 2 p. 129-130
2 p.
artikel
82 Calendar 1991
85-86 2 p. 145-146
2 p.
artikel
83 Calendar 1993
85-86 2 p. 173-
1 p.
artikel
84 Calendar 1991
85-86 2 p. 141-142
2 p.
artikel
85 Calendar 1993
85-86 2 p. 155-156
2 p.
artikel
86 Calendar 1982
85-86 2 p. 145-147
3 p.
artikel
87 Calendar 1990
85-86 2 p. 153-154
2 p.
artikel
88 Calendar 1981
85-86 2 p. 195-199
5 p.
artikel
89 Calendar 1989
85-86 2 p. 147-148
2 p.
artikel
90 Call for Papers 2003
85-86 2 p. 143-144
2 p.
artikel
91 Call for papers 1991
85-86 2 p. 143-
1 p.
artikel
92 Call for papers 1981
85-86 2 p. 199-
1 p.
artikel
93 Call for papers 1987
85-86 2 p. 171-
1 p.
artikel
94 Call for papers 1983
85-86 2 p. 162-163
2 p.
artikel
95 Cell/packet loss behavior in a statistical multiplexer with bursty input Yamada, Hiroshi
1993
85-86 2 p. 77-90
14 p.
artikel
96 Characterisation of programs for scheduling in multiprogrammed parallel systems Majumdar, Shikharesh
1991
85-86 2 p. 109-130
22 p.
artikel
97 Closed queueing networks with finite capacities: blocking types, product-form solution and performance indices Balsamo, S.
1991
85-86 2 p. 85-102
18 p.
artikel
98 CMG XI—Computer performance evaluation in the '80s 1981
85-86 2 p. 180-185
6 p.
artikel
99 Comparison of external sorting and internal sorting in virtual memory Inkeri Verkamo, A.
1986
85-86 2 p. 135-145
11 p.
artikel
100 COMPCON '81: Productivity — an urgent priority 1982
85-86 2 p. 133-138
6 p.
artikel
101 1983 computer measurement group International Conference XIV 1984
85-86 2 p. 133-147
15 p.
artikel
102 Computing system-time and system-length distributions for MAP/D/1 queue using distributional Little’s law Singh, Gagandeep
2012
85-86 2 p. 102-118
17 p.
artikel
103 Course 1987
85-86 2 p. 172-173
2 p.
artikel
104 Criticality condition for information floating with random walk of nodes Virtamo, Jorma
2013
85-86 2 p. 114-123
10 p.
artikel
105 Delay, jitter and threshold crossing in ATM systems with dispersed messages Cidon, I.
1997
85-86 2 p. 85-104
20 p.
artikel
106 Design of effective buffer control policies for ATM networks Seshadri, Sridhar
1996
85-86 2 p. 95-114
20 p.
artikel
107 Determining output uncertainty of computer system models Gluhovsky, Ilya
2007
85-86 2 p. 103-125
23 p.
artikel
108 Distribution of the delay in polling systems in heavy traffic van der Mei, R.D.
1999
85-86 2 p. 133-148
16 p.
artikel
109 Distributions of the interdeparture times in FCFS and nonpreemptive priority MMAP[2]/G[2]/1 queues He, Qi-Ming
1999
85-86 2 p. 85-103
19 p.
artikel
110 Dynamic demultiplexing in network calculus—Theory and application Wang, Hao
2011
85-86 2 p. 201-219
19 p.
artikel
111 Dynamic schemes for speculative execution of code Raghavan, Prabhakar
2003
85-86 2 p. 125-142
18 p.
artikel
112 Editorial Bux, Werner
1991
85-86 2 p. 83-84
2 p.
artikel
113 Editorial Bux, Werner
1991
85-86 2 p. 85-
1 p.
artikel
114 Editorial Kobayashi, Hisashi
1984
85-86 2 p. 79-
1 p.
artikel
115 Editorial 1981
85-86 2 p. 103-
1 p.
artikel
116 Editorial Kobayashi, Hisashi
1986
85-86 2 p. 91-
1 p.
artikel
117 Editorial Board 2009
85-86 2 p. IFC-
1 p.
artikel
118 Editorial Board 2003
85-86 2 p. IFC-
1 p.
artikel
119 Editorial Board 2004
85-86 2 p. IFC-
1 p.
artikel
120 Editorial Board 2008
85-86 2 p. IFC-
1 p.
artikel
121 Editorial Board 2007
85-86 2 p. CO2-
1 p.
artikel
122 Editorial Board 2010
85-86 2 p. IFC-
1 p.
artikel
123 Editorial Board 2006
85-86 2 p. CO2-
1 p.
artikel
124 Editorial Board 2013
85-86 2 p. IFC-
1 p.
artikel
125 Editorial Board 2011
85-86 2 p. IFC-
1 p.
artikel
126 Editorial Board 2012
85-86 2 p. IFC-
1 p.
artikel
127 Efficient methods for calculating the success function of fixed space replacement policies Olken, Frank
1983
85-86 2 p. 153-154
2 p.
artikel
128 Efficient simulation of QoS in ATM switches using connection traffic descriptors A. Akyamaç, Ahmet
1999
85-86 2 p. 105-132
28 p.
artikel
129 Efficient visit orders for polling systems Boxma, O.J.
1993
85-86 2 p. 103-123
21 p.
artikel
130 Erratum 1983
85-86 2 p. 155-
1 p.
artikel
131 Erratum notice 1981
85-86 2 p. 200-
1 p.
artikel
132 Estimating completion time ratios of a fork-join barrier synchronization Bach, Eric
1996
85-86 2 p. 145-154
10 p.
artikel
133 Evaluating decision support software: A managerial perspective 1983
85-86 2 p. 137-138
2 p.
artikel
134 Events 1986
85-86 2 p. 169-172
4 p.
artikel
135 Events 1985
85-86 2 p. 129-131
3 p.
artikel
136 Events 1988
85-86 2 p. 159-161
3 p.
artikel
137 Events 1987
85-86 2 p. 169-171
3 p.
artikel
138 Events 1989
85-86 2 p. 163-165
3 p.
artikel
139 Events 1983
85-86 2 p. 157-161
5 p.
artikel
140 Events 1984
85-86 2 p. 149-152
4 p.
artikel
141 Exact results for the cyclic-service queue with a Bernoulli schedule Tedijanto,
1990
85-86 2 p. 107-115
9 p.
artikel
142 Experimental design of a generative model based on working set size characterizations Paul Lee, Tzong-yu
1983
85-86 2 p. 151-152
2 p.
artikel
143 Fifth International Conference on Analysis and Optimization of Systems 1983
85-86 2 p. 131-136
6 p.
artikel
144 File migration in distributed computer systems Porcar, Juan M.
1983
85-86 2 p. 151-
1 p.
artikel
145 Foreword to “Queues with ordered servers that work at different rates: An exact analysis of a model solved approximately by others” by R.B. Cooper Takagi, Hideaki
1987
85-86 2 p. 145-
1 p.
artikel
146 Hierarchical use of dedicated channels Akavia, Gideon Y
1989
85-86 2 p. 135-142
8 p.
artikel
147 IFC - Editorial Board 2003
85-86 2 p. IFC-
1 p.
artikel
148 Improved bounds for performability evaluation algorithms using state generation Oikonomou, Kostas N.
2009
85-86 2 p. 121-135
15 p.
artikel
149 Input/output optimization and disk architectures: A survey Smith, Alan Jay
1981
85-86 2 p. 104-117
14 p.
artikel
150 Interdeparture times from a queuing system with preemptive resume priority Nain, Philippe
1984
85-86 2 p. 93-98
6 p.
artikel
151 International Conference on Local and Metropolitan Communication Systems 7–9 December 1994, Kyoto, Japan Kasahara, Shoji
1995
85-86 2 p. 185-196
12 p.
artikel
152 International Conference on the Performance and Management of Complex Communication Networks: PMCCN '97 17–21 November 1997, Tsukuba Science City, Japan Kasahara, Shoji
1998
85-86 2 p. 137-144
8 p.
artikel
153 International conference on the performance of distributed systems and integrated communication networks Takagi, Hideaki
1992
85-86 2 p. 121-128
8 p.
artikel
154 International Seminars on Software Engineering 1983
85-86 2 p. 144-147
4 p.
artikel
155 Knowledge-based distributed systems management Pasquale, J.
1987
85-86 2 p. 165-
1 p.
artikel
156 k-out-of-n system with repair: the max(N,T) policy Ushakumari, P.V.
2004
85-86 2 p. 221-234
14 p.
artikel
157 Local-area subnetworks: A performance comparison 1981
85-86 2 p. 193-
1 p.
artikel
158 Markov modulated periodic arrival process offered to an ATM multiplexer Akar, Nail
1995
85-86 2 p. 175-190
16 p.
artikel
159 Mean-field framework for performance evaluation of push–pull gossip protocols Bakhshi, Rena
2011
85-86 2 p. 157-179
23 p.
artikel
160 Mean Value Analysis Approximation for multiple server queueing networks Akyildiz, Ian F
1988
85-86 2 p. 77-91
15 p.
artikel
161 Measurement, modeling and evaluation of computing systems 1981
85-86 2 p. 188-189
2 p.
artikel
162 Message from the program chairs Nicol, David
2011
85-86 2 p. 89-
1 p.
artikel
163 Modeling IP traffic using the batch Markovian arrival process Klemm, Alexander
2003
85-86 2 p. 149-173
25 p.
artikel
164 Modeling real DASD configurations 1981
85-86 2 p. 192-
1 p.
artikel
165 Modelling storage organizations: A dynamic approach 1981
85-86 2 p. 192-
1 p.
artikel
166 Modelling storage organizations: A dynamic approach Stein, David M
1982
85-86 2 p. 81-97
17 p.
artikel
167 Modelling techniques and tools for computer performance evaluation Field, Tony
2003
85-86 2 p. 77-78
2 p.
artikel
168 Moment analysis for closed queuing networks and its linearizer Strelen, Johann Christoph
1990
85-86 2 p. 127-142
16 p.
artikel
169 Multiclass Queueing Networks with State-Dependent Routing Krzesinski, A.E.
1987
85-86 2 p. 125-143
19 p.
artikel
170 Multiprocessor systems with preemptive priorities Mitrani, I.
1981
85-86 2 p. 118-125
8 p.
artikel
171 2nd International Conference on Modelling Techniques and Tools for Performance Analysis 1986
85-86 2 p. 162-166
5 p.
artikel
172 Norton's equivalent for queueing networks comprised of quasireversible components linked by state-dependent routing Boucherie, Richard J.
1998
85-86 2 p. 83-99
17 p.
artikel
173 On channel sharing in discrete-time, multi-access broadcast communication 1981
85-86 2 p. 191-
1 p.
artikel
174 On submesh allocation for 2D mesh multicomputers using the free-list approach: Global placement schemes Ababneh, Ismail
2009
85-86 2 p. 105-120
16 p.
artikel
175 On the arrival theorem for queueing networks operating under a just-in-time protocol Boucherie, Richard J.
1998
85-86 2 p. 109-121
13 p.
artikel
176 On the foundations of artificial workload design Ferrari, Domenico
1983
85-86 2 p. 153-
1 p.
artikel
177 On the Geo/D/1 and Geo/D/1/n queues Gravey, Annie
1990
85-86 2 p. 117-125
9 p.
artikel
178 On the M/C k /1 queue Perros, H.G.
1983
85-86 2 p. 83-93
11 p.
artikel
179 On the modeling of shared resources with various lock granularities using queueing networks Hać, Anna
1986
85-86 2 p. 103-115
13 p.
artikel
180 On the performance characteristics of a TASI system Falin, Gennadi
1993
85-86 2 p. 141-148
8 p.
artikel
181 On the performance evaluation of query-based wireless sensor networks Degirmenci, Guvenc
2013
85-86 2 p. 124-147
24 p.
artikel
182 Optimal anticipative congestion control of flows with time-varying input stream Jacko, Peter
2012
85-86 2 p. 86-101
16 p.
artikel
183 Optimal control by the retransmission probability in slotted ALOHA systems Fainberg, E.A
1985
85-86 2 p. 85-96
12 p.
artikel
184 Optimal control of variable rate coding in integrated voice/data packet networks Saito, Hiroshi
1989
85-86 2 p. 115-128
14 p.
artikel
185 Optimization of polling systems with Bernoulli schedules Blanc, J.P.C.
1995
85-86 2 p. 139-158
20 p.
artikel
186 PAM—A noniterative approximate solution method for closed multichain queueing networks Ching-Tarng Hsieh,
1989
85-86 2 p. 119-133
15 p.
artikel
187 PEPA nets: a structured performance modelling formalism Gilmore, Stephen
2003
85-86 2 p. 79-104
26 p.
artikel
188 Performance '84 1985
85-86 2 p. 119-128
10 p.
artikel
189 Performance analysis of a cellular network using frequency reuse partitioning Kim, Seung-Yeon
2013
85-86 2 p. 77-89
13 p.
artikel
190 Performance analysis of admission control algorithms based on reward optimization for real-time multimedia servers Chen, Ing-Ray
1998
85-86 2 p. 89-112
24 p.
artikel
191 Performance analysis of an input queueing ATM switch with two priority classes Lee, Jang Won
1998
85-86 2 p. 137-149
13 p.
artikel
192 Performance analysis of an integrated hybrid-switched multiplex structure Kwong, R.H
1984
85-86 2 p. 81-91
11 p.
artikel
193 Performance analysis of a photonic single-hop ATM switch architecture, with tunable transmitters and fixed frequency receivers McKinnon, Martin W.
1998
85-86 2 p. 113-136
24 p.
artikel
194 Performance analysis of integrated services on a single server system Yang, Oliver W.W.
1990
85-86 2 p. 79-92
14 p.
artikel
195 Performance analysis of interprocessor communications in an electronic switching system with distributed control Sumita, Shuichi
1989
85-86 2 p. 83-91
9 p.
artikel
196 Performance analysis of locking and optimistic concurrency control algorithms Morris, R.J.T
1985
85-86 2 p. 105-118
14 p.
artikel
197 Performance analysis of locking methods with limited wait depth Thomasian, Alexander
1998
85-86 2 p. 69-89
21 p.
artikel
198 Performance analysis of reactive congestion control based upon queue length threshold values Kato, Manabu
1997
85-86 2 p. 105-125
21 p.
artikel
199 Performance analysis of the load building algorithm in the change and test system Hać, Anna
1991
85-86 2 p. 131-143
13 p.
artikel
200 Performance analysis of threshold-based selective drop mechanism for high performance packet switches Yang, Jui-Pin
2004
85-86 2 p. 163-176
14 p.
artikel
201 Performance evaluation of a worst case model of the MetaRing MAC protocol with global fairness Anastasi, G.
1997
85-86 2 p. 127-151
25 p.
artikel
202 Performance evaluation of closed tandem queueing networks with finite buffers Bouhchouch, Abdellatif
1996
85-86 2 p. 115-132
18 p.
artikel
203 Performance evaluation of real-time speech through a packet network: a random neural networks-based approach Mohamed, Samir
2004
85-86 2 p. 141-161
21 p.
artikel
204 Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks Bouras, C.J.
1996
85-86 2 p. 105-130
26 p.
artikel
205 Performance models for information communication networks Hashida, On
1995
85-86 2 p. 91-92
2 p.
artikel
206 Performance of a dual-bus fiber optic network operating under a probabilistic scheduling strategy Mukherjee, Biswanath
1991
85-86 2 p. 127-139
13 p.
artikel
207 Performance of contention processing schemes for WDM networks with control channels Kim, Doo Seok
1996
85-86 2 p. 85-104
20 p.
artikel
208 Performance of fault-tolerant sorting network for ATM switching Sharma, Neeraj K.
1998
85-86 2 p. 91-107
17 p.
artikel
209 Performance study of a probabilistic multicast transport protocol Özkasap, Öznur
2004
85-86 2 p. 177-198
22 p.
artikel
210 Poisson winner queues Kleinrock, Leonard
1992
85-86 2 p. 79-101
23 p.
artikel
211 Polling systems with zero switch-over periods: a general method for analyzing the expected delay Levy, Hanoch
1991
85-86 2 p. 97-107
11 p.
artikel
212 Probability and statistics with reliability, queuing and computer science applications Ferrari, Domenico
1983
85-86 2 p. 149-150
2 p.
artikel
213 Program restructing in segmented virtual memory Alanko, Timo O.
1981
85-86 2 p. 153-169
17 p.
artikel
214 Pseudo-conservation law for a priority polling system with mixed service strategies Takahashi, Yoshitaka
1995
85-86 2 p. 107-120
14 p.
artikel
215 Quasi-birth-and-death processes with restricted transitions and its applications Pérez, Juan F.
2011
85-86 2 p. 126-141
16 p.
artikel
216 Query optimization in distributed databases through load balancing Alonso, R.
1987
85-86 2 p. 165-166
2 p.
artikel
217 Queueing modeling of a single processor with failures Altiok, Tayfur
1989
85-86 2 p. 93-102
10 p.
artikel
218 Queueing models for buffers with dial-up servers King, Peter J.B
1989
85-86 2 p. 129-145
17 p.
artikel
219 Queueing systems with service interruptions: An approximation model Nain, Philippe
1983
85-86 2 p. 123-129
7 p.
artikel
220 Queues with ordered servers that work at different rates: An exact analysis of a model solved approximately by others Cooper, Robert B.
1987
85-86 2 p. 147-149
3 p.
artikel
221 Robust bounds and throughput guarantees for closed multiclass queueing networks Majumdar, Shikharesh
1998
85-86 2 p. 101-136
36 p.
artikel
222 Simple bounds for queueing systems with breakdowns Van Dijk, Nico M.
1988
85-86 2 p. 117-128
12 p.
artikel
223 Simultaneity in discrete-time single server queues with Bernoulli inputs Gravey, A.
1992
85-86 2 p. 123-131
9 p.
artikel
224 Simultaneous busy periods for nodes in a stochastic network Daduna, Hans
1989
85-86 2 p. 103-109
7 p.
artikel
225 Solving the ME/ME/1 queue with state–space methods and the matrix sign function Akar, Nail
2006
85-86 2 p. 131-145
15 p.
artikel
226 Some equivalencies between closed queueing networks with blocking Onvural, Raif O
1989
85-86 2 p. 111-118
8 p.
artikel
227 Stability and performance of overlay multicast systems employing forward error correction Dán, György
2010
85-86 2 p. 80-101
22 p.
artikel
228 Stability of flow-level scheduling with Markovian time-varying channels Kim, Jeongsim
2013
85-86 2 p. 148-159
12 p.
artikel
229 Steady-state analysis of ATM multiplexer with variable input rate through diffusion approximation Kobayashi, Kazutomo
1995
85-86 2 p. 163-184
22 p.
artikel
230 Strategy independent program restructuring using the critical reference principle Lan, Kwai-Ting
1984
85-86 2 p. 105-115
11 p.
artikel
231 14th conference of the European computer measurement association (ECOMA-14) Schreiner-Novick, Nancy A.
1987
85-86 2 p. 151-164
14 p.
artikel
232 13th conference of the European computer measurement association (ECOMA-13) 1986
85-86 2 p. 147-161
15 p.
artikel
233 The distribution of network states during residence times in product form queueing networks Zahorjan, John
1984
85-86 2 p. 99-104
6 p.
artikel
234 The EELRU adaptive replacement algorithm Smaragdakis, Yannis
2003
85-86 2 p. 93-123
31 p.
artikel
235 The effects of two-phase locking on the performance of a distributed database management system Thanos, C
1988
85-86 2 p. 129-157
29 p.
artikel
236 The finite-buffer M/G/1 queue with general bulk-service rule and single vacation Gupta, U.C.
2004
85-86 2 p. 199-219
21 p.
artikel
237 The general form linearizer algorithms: A new family of approximate mean value analysis algorithms Wang, Hai
2008
85-86 2 p. 129-151
23 p.
artikel
238 The impact of the service discipline on delay asymptotics Borst, S.C.
2003
85-86 2 p. 175-206
32 p.
artikel
239 The influence of locality in routing on queuing networks Dandamudi, Sivarama P.
1990
85-86 2 p. 93-106
14 p.
artikel
240 The ins and outs of the probabilistic model checker MRMC Katoen, Joost-Pieter
2011
85-86 2 p. 90-104
15 p.
artikel
241 The Markov-modulated Poisson process (MMPP) cookbook Fischer, Wolfgang
1993
85-86 2 p. 149-171
23 p.
artikel
242 The Möbius state-level abstract functional interface Derisavi, Salem
2003
85-86 2 p. 105-128
24 p.
artikel
243 The properties and limiting behavior of working set size strings and flat-faults Paul Lee, Tzong-yu
1983
85-86 2 p. 152-
1 p.
artikel
244 5th International conference on software engineering 1982
85-86 2 p. 138-144
7 p.
artikel
245 Third Hungarian computer science conference 1981
85-86 2 p. 187-188
2 p.
artikel
246 Throughput calculation for basic stochastic rendezvous networks Woodside, C.Murray
1989
85-86 2 p. 143-160
18 p.
artikel
247 Throughputs in processor sharing models for integrated stream and elastic traffic Litjens, Remco
2008
85-86 2 p. 152-180
29 p.
artikel
248 Time-bounded reachability in tree-structured QBDs by abstraction Klink, Daniel
2011
85-86 2 p. 105-125
21 p.
artikel
249 TIMS XXX - SOBRAPO XXIII joint international meeting de Souza e Silva, E
1992
85-86 2 p. 115-120
6 p.
artikel
250 Towards performance improvement of cut-through switching in computer networks Ilyas, Mohammad
1986
85-86 2 p. 125-133
9 p.
artikel
251 Trace data characterization and fitting for Markov modeling Casale, Giuliano
2010
85-86 2 p. 61-79
19 p.
artikel
252 Transient analysis of fluid model for ATM statistical multiplexer Tanaka, Takeshi
1995
85-86 2 p. 145-162
18 p.
artikel
253 Transient behavior for some Jackson networks Lebah, M.
1993
85-86 2 p. 115-122
8 p.
artikel
254 Understanding the simulation of mobility models with Palm calculus Le Boudec, Jean-Yves
2007
85-86 2 p. 126-147
22 p.
artikel
255 Using adaptive routing to achieve Quality of Service Su, Pu
2004
85-86 2 p. 105-119
15 p.
artikel
256 Validation of admission delay model for two-link virtual route with window flow control Papir, Zdzislaw
1987
85-86 2 p. 83-86
4 p.
artikel
257 Working set size strings Ferrari, Domenico
1983
85-86 2 p. 152-153
2 p.
artikel
                             257 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland