VLSI based hardware accelerator for compute intensive routing applications
Identifying the most optimal paths (or routes) in a network is one of the most extensively studied problems in the field of graph theory. The advent of complex applications such as the VLSI place and route, vehicle navigation, high-speed communication, graph matching, dynamic robot path planning, et...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
出版: |
2008
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/2340 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |