This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Path Finding with Associative Memory
July 1968 (vol. 17 no. 7)
pp. 691-693
B.A. Crane, IEEE
Abstract?This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory's highly parallel search and arithmetic capabilities and which is economical in storage requirements.
Index Terms:
Index terms?Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.
Citation:
B.A. Crane, "Path Finding with Associative Memory," IEEE Transactions on Computers, vol. 17, no. 7, pp. 691-693, July 1968, doi:10.1109/TC.1968.227419
Usage of this product signifies your acceptance of the Terms of Use.