Last update: Thu Jun 20 02:01:00 MDT 2019
Top |
Symbols |
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{Atlasis:2000:ULA,
author = "Antonios F. Atlasis and Nikolaos H. Loukas and
Athanasios V. Vasilakos",
title = "The use of learning algorithms in {ATM} networks call
admission control problem: a methodology",
journal = j-COMP-NET-AMSTERDAM,
volume = "34",
number = "3",
pages = "341--353",
month = sep,
year = "2000",
CODEN = "????",
ISSN = "1389-1286 (print), 1872-7069 (electronic)",
ISSN-L = "1389-1286",
bibdate = "Sat Oct 21 17:37:31 MDT 2000",
bibsource = "http://www.elsevier.com/locate/issn/13891286;
http://www.math.utah.edu/pub/tex/bib/compnetamsterdam2000.bib",
URL = "http://www.elsevier.nl/gej-ng/10/15/22/49/25/24/abstract.html;
http://www.elsevier.nl/gej-ng/10/15/22/49/29/24/article.pdf",
acknowledgement = ack-nhfb,
journal-URL = "http://www.sciencedirect.com/science/journal/13891286",
}
Related entries
- admission,
32(1)61,
34(1)49,
35(2)307,
36(2)181,
37(5)507,
38(5)577,
38(6)765,
40(1)57,
41(4)489,
42(6)779,
43(3)263,
44(4)463,
44(6)757,
46(1)87,
48(2)137,
50(11)1653,
51(3)699,
51(10)2738,
51(11)3305,
51(12)3491,
51(13)3902,
51(16)4669,
52(6)1281,
52(14)2805,
52(17)3258,
53(2)231,
53(8)1186,
53(11)1771
- algorithm,
33(1)449,
34(2)279,
34(3)481,
35(2)287,
36(2)251,
37(3)331,
37(5)631,
38(3)311,
38(4)447,
38(6)765,
39(4)363,
39(4)457,
39(5)681,
39(6)729,
41(1)41,
41(2)227,
41(4)363,
41(6)727,
42(4)503,
42(6)697,
43(3)247,
43(5)669,
44(1)17,
44(1)43,
45(2)155,
45(6)731,
46(4)505,
47(1)87,
47(4)525,
47(6)785,
48(2)155,
48(2)215,
48(6)972,
49(2)201,
49(2)243,
49(4)476,
49(4)593,
50(2)207,
50(3)422,
50(8)1086,
50(8)1176,
50(9)1384,
50(11)1710,
50(11)1816,
50(13)2239,
50(13)2286,
50(15)2713,
50(15)2805,
50(16)2981,
50(17)3225,
50(17)3375,
51(1)69,
51(4)1031,
51(6)1499,
51(6)1705,
51(8)1998,
51(8)2104,
51(9)2223,
51(11)3110,
51(11)3172,
51(11)3252,
51(13)3919,
51(14)3989,
51(15)4270,
51(16)4669,
52(3)531,
52(3)542,
52(5)1093,
52(6)1238,
52(7)1492,
52(9)1675,
52(10)1905,
52(13)2473,
52(13)2543,
52(15)2819,
52(15)2894,
52(16)3130,
52(17)3229,
53(1)25,
53(1)110,
53(3)247,
53(7)926,
53(7)945,
53(9)1480,
53(13)2275,
53(14)2458,
53(14)2537,
53(18)2997
- ATM,
32(1)17,
32(1)61,
32(2)171,
32(3)325,
32(3)333,
32(5)571,
34(1)1,
34(1)23,
34(1)49,
34(1)65,
34(1)85,
34(1)129,
34(1)169,
34(1)199,
34(1)211,
34(2)263,
34(3)419,
34(3)439,
34(6)965,
35(2)203,
35(2)237,
36(5)643,
38(5)645,
39(4)423
- call,
35(2)369,
35(5)521,
36(4)489,
38(5)577,
38(5)591,
42(2)141,
42(2)281,
42(5)695,
43(3)263,
45(3)281,
50(17)3334,
51(2)496,
51(2)536,
51(4)1060,
51(12)3491,
52(12)2432
- learning,
37(6)773,
42(3)285,
47(6)825,
50(10)1488,
51(5)1239,
51(13)3773,
52(2)399
- methodology,
35(6)627,
37(2)137,
40(2)257,
41(5)623,
48(3)447,
52(14)2677
- problem,
34(4)623,
38(4)531,
39(6)729,
42(2)199,
45(1)55,
48(6)856,
50(10)1581,
51(14)3989,
52(4)795,
52(9)1721,
52(11)2205,
52(17)3218,
53(5)680
- use,
33(1)347,
35(4)401,
43(6)787,
49(2)243,
49(5)643,
51(6)1515,
51(8)2126,
53(11)1903