Computational Graph Theory for Computer and Communication Systems |
| Session Type: Lecture
|
| Time: Tuesday, May 28, 3:30 - 5:00
|
| Location: Ballroom I
|
| |
| 3170: ALGORITHMIC ASPECTS OF UNCERTAINTY DRIVEN SCHEDULING |
| Ogrenci Memik, Seda: University of California Los Angeles |
| Srivastava, Ankur: University of California, Los Angeles |
| Kursun, Eren : University of California, Los Angeles |
| Sarrafzadeh, Majid: University of California, Los Angeles |
| |
| 3206: THE BI-WEIGHTED TSP PROBLEM FOR CROSSTALK MINIMIZATION |
| Wong, D. F.: University of Texas at Austin |
| Shao, Muzhou: University of Texas at Austin |
| |
| 3190: THE PRIME-GRAPH AND Q-SEQUENCE FOR CODING THE FLOORPLAN |
| KAJITANI, Yoji: University of Kitakyusyu |
| SAKANUSHI, Keishi: Tokyo Institute of Technology |
| |
| 3164: QUALITY OF SERVICE ROUTING: HEURISTICS AND APPROXIMATION SCHEMES WITH A COMPARATIVE EVALUATION |
| Ravindran, Ravi: Nortel Networks |
| Thulasiraman, Krishnaiyan: University of Oklahoma |
| Das, Anindya : University of Western Ontario |
| Huang, Kaiyuan: Nortel Networks |
| Luo, Gang: Nortel Networks |
| Xue, Guoliang: Arizona State University |
| |
| 3163: ON THREE-DIMENSIONAL LAYOUT OF DE BRUIJN NETWORKS |
| Yamada, Toshinori: Tokyo Institute of Technology |
| Ueno, Shuichi: Tokyo Institute of Technology |
| |
