“Papers of School of Computer Science”
Pages:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
311. P. Shareghi and H. Sarbazi-Azad,
Topological properties of necklace networks,
in: ISPAN, , 2005, pp. 40-45 [abstract]
312. N. Imani, H. Sarbazi-Azad and S. G. Akl,
On some combinatorial properties of the star graph,
in: ISPAN, , 2005, pp. 58-65 [abstract]
313. P. Shareghi and H. Sarbazi-Azad,
The stretched-hypercube: a VLSI efficient network topology,
in: ISPAN, , 2005, pp. 462-467 [abstract]
314. H.R. Zarandi and H. Sarbazi-Azad,
Hierarchical binary set partitioning in cache memories,
The Journal of Supercomputing 31(2005), 185-202 [abstract]
315. H. Sarbazi-Azad and M. Ould-Khaoua,
Constraint-based performance analysis of k-ary n-cube networks,
International Journal of Computers and Their Applications 12(2005), 83-92 [abstract]
316. A. Masoudnia, H. Sarbazi-Azad and S. Boussakta,
A pixel level pipelined parallel architecture for wavelet based image compression: design, implementation, performance,
Computers & Electrical Engineering 31(2005), 572-588 [abstract]
317. H. Beigy,
Asynchronous cellular learning automata,
(2005), [abstract]
318. H. Beigy and M. R. Meybodi,
An adaptive call admission algorithm for cellular networks,
Computers & Electrical Engineering 31(2005), 132-151 [abstract]
319. H. Beigy and M. R. Meybodi,
A general call admission policy for next generation wireless networks,
Computer Communications 28(2005), 1798-1813 [abstract]
320. H. Hajiabolhassan, M. L. Mehrabadi and R. Tusserkani,
Tabular graphs and chromatic sum,
Discrete Mathematics 304(2005), 11-22 [abstract]
back to top
Pages:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
