A new algorithm for finding the shortest paths using PCNN
10.1007/978-3-540-69226-3_12
Saved in:
Main Authors: | Tang, H., Tan, K.C., Yi, Z. |
---|---|
Other Authors: | ELECTRICAL & COMPUTER ENGINEERING |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/54483 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
New cost calculation method for finding shortest path of hybrid VANET protocol
by: Phongsathorn Boonnithiphat, et al.
Published: (2018) -
New cost calculation method for finding shortest path of hybrid VANET protocol
by: Phongsathorn Boonnithiphat, et al.
Published: (2018) -
New cost calculation method for finding shortest path of hybrid VANET protocol
by: Boonnithiphat P., et al.
Published: (2017) -
Finding all hops shortest paths with quality-of-service constraints
by: Su, Myat Mon.
Published: (2012) -
Finding the shortest route using cases, knowledge, and Dijkstra's algorithm
by: Liu, Bing, et al.
Published: (2014)