Published 1995
| Published
Book Section - Chapter
Open
Analog and VLSI implementation of connectionist network for minimum spanning tree problems
- Creators
- Ng, H. S.
- Lam, K. P.
- Tai, W. K.
Abstract
We describe a connectionist architecture which shows promise in obtaining the global optimal solution to the classical minimum spanning tree problem in a time independent of the problem size. Using commonly available analogue electronic components, a network prototype was found to give the global optimal solution within the microseconds range. Simulation results and limiting factors of the performance of analog and VLSI implementation circuits are discussed.
Additional Information
© 1995 IEEE. Date of Current Version: 06 August 2002. This work was supported by the Hong Kong Research Grant Council under Grant No. CUHK 58/933Attached Files
Published - NGHtencon95.pdf
Files
NGHtencon95.pdf
Files
(399.1 kB)
Name | Size | Download all |
---|---|---|
md5:11c001a99f6a99affce939f95d78c394
|
399.1 kB | Preview Download |
Additional details
- Eprint ID
- 29452
- Resolver ID
- CaltechAUTHORS:20120224-094815033
- CUHK 58/933
- Hong Kong Research Grant Council
- Created
-
2012-02-24Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 5262632