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:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/2340 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |