Entry Combe:1994:OST from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Combe:1994:OST,
author = "M. B. Comb{\'e} and O. J. Boxma",
title = "Optimization of static traffic allocation policies",
journal = j-THEOR-COMP-SCI,
volume = "125",
number = "1",
pages = "17--43",
day = "14",
month = mar,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=125&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=125&issue=1&aid=1540",
acknowledgement = ack-nhfb,
classification = "B0260 (Optimisation techniques); B6150M (Protocols);
C1180 (Optimisation techniques); C5640 (Protocols);
C6150N (Distributed systems)",
corpsource = "CWI, Amsterdam, Netherlands",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "mean waiting time; optimisation; optimization;
optimization aspects; probabilistic assignment;
protocols; scheduling; servers; static traffic
allocation policies; system performance measures",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- allocation,
111(1)3,
130(1)73
- aspect,
71(1)133,
81(1)147,
84(2)281,
90(1)1,
98(1)z,
123(1)z
- assignment,
87(1)189,
87(1)203,
102(1)135,
104(2)285,
107(2)253,
129(1)39,
130(1)73
- B0260,
92(1)49,
94(2)175,
97(1)175,
102(2)253
- B6150M,
108(2)291,
128(1)63,
129(1)1,
132(1)291
- C1180,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(1)185,
102(2)253,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263
- C5640,
95(1)169,
108(2)291,
128(1)63,
129(1)1,
132(1)291
- C6150N,
89(1)179,
128(1)127,
128(1)159,
130(1)5,
130(1)17,
130(1)49,
130(1)73,
130(1)175
- distributed,
71(1)133,
73(1)61,
74(2)121,
75(3)263,
76(2)285,
81(2)237,
89(1)179,
91(2)285,
95(1)169,
96(1)3,
100(1)185,
100(1)223,
108(2)291,
109(1)123,
110(2)341,
114(1)31,
114(1)63,
120(1)101,
120(2)261,
122(1)165,
128(1)63,
128(1)127,
128(1)159,
130(1)5,
130(1)17,
130(1)49,
130(1)73,
130(1)175,
133(2)341
- mean,
70(2)213,
74(3)355,
75(3)347,
87(1)43
- measure,
73(2)121,
73(3)265,
79(2)323,
81(1)127,
82(1)157,
85(2)305,
112(2)277,
122(1)97,
125(1)61,
125(1)111,
127(1)123,
128(1)179
- optimisation,
76(1)143,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
99(1)157,
102(1)185,
102(2)253,
104(2)285,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263,
134(2)559
- optimization,
71(2)265,
76(1)143,
80(2)303,
81(2)317,
82(1)1,
84(1)77,
84(2)179,
90(1)17,
90(1)61,
94(2)175,
97(1)105,
99(1)157,
104(2)285,
107(1)3,
107(1)145,
116(1)59,
118(2)231,
123(1)9,
128(1)179,
134(2)493
- performance,
80(1)105,
106(2)243,
125(1)61,
125(1)91,
125(1)111,
125(1)149,
128(1)127,
128(1)159,
128(1)179,
128(1)211,
128(1)241
- probabilistic,
79(1)37,
81(1)65,
85(2)305,
88(1)1,
92(2)249,
93(2)201,
93(2)265,
106(2)395,
113(1)167,
116(2)373,
123(1)131
- protocol,
76(2)223,
84(1)23,
95(1)169,
108(2)291,
128(1)63,
128(1)127,
129(1)1,
132(1)291,
134(2)545
- scheduling,
75(3)347,
95(1)1,
100(1)105,
118(1)3,
125(1)3,
128(1)75,
130(1)5,
130(1)17,
130(1)49,
130(1)175
- server,
98(2)339,
106(2)243,
130(1)73,
130(1)85
- static,
76(1)53,
90(1)95,
95(1)1,
95(1)43,
118(2)231,
124(1)127,
131(2)295,
136(1)217