On-the-fly Fastest Path Computation in Event Dependent Network
碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 100 === In recent years, the fastest path algorithms were applied on the navigation. However, existing algorithms have two disadvantages. One is repeated computation, and the other is long response time or inaccurate results on large networks. Hence, they are not sui...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67652999193015037371 |