Last update: Sat Mar 2 02:07:13 MST 2019
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{Kim:2003:DLS,
author = "H. J. Kim and V. Mani",
title = "Divisible load scheduling in single-level tree
networks: Optimal sequencing and arrangement in the
nonblocking mode of communication",
journal = j-COMPUT-MATH-APPL,
volume = "46",
number = "10--11",
pages = "1611--1623",
month = nov # "\slash " # dec,
year = "2003",
CODEN = "CMAPDK",
ISSN = "0898-1221 (print), 1873-7668 (electronic)",
ISSN-L = "0898-1221",
bibdate = "Wed Mar 1 21:49:30 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/computmathappl2000.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0898122103901969",
acknowledgement = ack-nhfb,
fjournal = "Computers and Mathematics with Applications",
journal-URL = "http://www.sciencedirect.com/science/journal/08981221",
}
Related entries
- arrangement,
39(5)239
- communication,
39(7)59,
43(6)901,
46(2)508,
46(2)516,
49(9)1413,
51(2)377,
53(11)1633,
57(11)1730,
58(7)1433,
58(9)1687
- divisible,
46(10)1545,
49(9)1413,
52(10)1529,
58(6)1081
- Kim, H. J.,
40(10)1205,
49(9)1413
- load,
46(1)105,
46(10)1545,
46(10)1671,
49(9)1413,
52(10)1529,
57(5)772,
57(11)1785,
57(11)1883,
58(6)1081,
58(11)2260
- Mani, V.,
46(10)1545,
49(9)1413,
58(1)39
- mode,
47(2)301,
49(9)1413,
56(1)1
- nonblocking,
49(9)1413
- optimal,
39(1)215,
39(7)117,
39(12)101,
40(10)1297,
40(10)1315,
41(7)893,
41(7)1049,
41(10)1245,
43(10)1203,
46(7)987,
46(7)999,
46(7)1047,
46(7)1081,
46(7)1089,
46(7)1095,
46(7)1103,
46(7)1119,
46(7)1129,
46(7)1139,
46(10)1657,
48(5)691,
48(5)943,
49(5)777,
49(9)1355,
50(1)217,
50(3)359,
50(3)425,
51(2)229,
51(2)317,
51(2)363,
51(2)371,
51(9)1405,
52(1)161,
52(5)625,
52(5)735,
52(5)759,
52(8)1317,
53(1)80,
53(3)569,
53(10)1582,
53(11)1672,
54(2)192,
55(4)714,
55(6)1333,
55(8)1794,
55(11)2458,
56(4)965,
56(6)1643,
56(9)2145,
56(10)2468,
56(10)2757,
56(11)2819,
57(1)42,
57(6)867,
57(11)1835,
58(1)39,
58(9)1687,
58(10)1921,
58(10)1965,
58(10)2035
- scheduling,
39(7)117,
41(10)1379,
43(12)1521,
44(3)539,
46(10)1545,
49(9)1413,
50(10)1629,
51(2)345,
51(3)515,
51(9)1507,
51(9)1571,
52(10)1529,
53(11)1658,
53(11)1733,
55(11)2458,
56(1)151,
56(4)891,
56(5)1303,
56(8)1941,
57(1)9,
57(4)619,
58(1)39,
58(1)95,
58(6)1081,
61(9)2929
- sequencing,
55(5)912
- tree,
40(4)607,
41(5)669,
45(10)1778,
48(5)747,
50(3)367,
55(11)2662,
56(2)387,
56(4)909,
56(11)2786