“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
281. M. A. Abam and M. Ghodsi,
An approximation algorithm for d1-optimal motion of a rod robot with fixed rotations,
International Journal of Computer Mathematics 83(2006), 357 - 370 [abstract]
282. A. R. Zarei and M. Ghodsi,
a new algorithm for guarding triangulated irregular networks,
CSI Journal of CSE (to appear) [abstract]
283. B. Bagheri Hariri and H. Abolhassani,
A New Evaluation Method for Ontology Alignment Measures,
in: ASWC, 4185, 2006, pp. 249-255 [abstract]
284. A. Bagheri and M. Razzazi,
On drawing of free trees on 2d grids which are bounded by simple polygons,
13(2006), 387-394 [abstract]
285. A. E. Kiasari and H. Sarbazi-Azad,
A Comparative Performance Analysis of n-Cubes and Star Graphs,
in: IPDPS, , 2006, pp. [abstract]
286. A. E. Kiasari, H. Sarbazi-Azad and M. Ould-Khaoua,
Analytical Performance Modelling of Adaptive Routing in Star Interconnection Network,
in: IPDPS, , 2006, pp. [abstract]
287. D. Rahmati, A. E. Kiasari, S. Hessabi and H. Sarbazi-Azad,
A Performance and Power Analysis of WK-Recursive and Mesh Networks for Network-on-Chips,
in: ICCD, , 2006, pp. 142-147 [abstract]
288. R. Khosravi and M. Ghodsi,
Shortest Paths with Single-Point Visibility Constraint,
13(2006), 25-32 [abstract]
289. A. Khonsari and M. Ould_Khaoua,
A performance model of compressionless routing in k-ary n-cube networks,
Performance Evaluation 63(2006), 423-440 [abstract]
290. R. Khosravi and M. Ghodsi,
The fastest way to view a query point in simple polygons,
in: EWCG, , 2005, pp. 187-190 [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
