Referenced Items are not available for this document.
The objective of the graphical shortest path problem is to discover the least cost path in a weighted graph between a given source vertex and one or more destinations. This problem class has numerous practical applications including data network routing and speech recognition. This paper discusses the hardware realization of a recurrent spatiotemporal neural network for single source multiple-destination graphical shortest path problems. The network exhibits a regular interconnect structure and uses simple processing units in a combination which is well suited for VLSI implementation with a standard fabrication process.
Published in:
Signals, Systems and Computers, 1995. 1995 Conference Record of the Twenty-Ninth Asilomar Conference on
(Volume:2
)
Date of Conference: Oct. 30 1995-Nov. 1 1995
- Page(s):
- 876 - 880 vol.2
- Meeting Date :
- 30 Oct 1995-02 Nov 1995
- ISSN :
- 1058-6393
- Print ISBN:
- 0-8186-7370-2
- INSPEC Accession Number:
- 5450350
- Conference Location :
- Pacific Grove, CA, USA
- Digital Object Identifier :
- 10.1109/ACSSC.1995.540825
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
