Presentation 1994/9/24
Analogic CNN Algorithm Exploring the Shortest Path : Possible Applications in Routing Problems
Csaba Rekeczky, Akio Ushida, Tamas Roska,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Since its invention,the CNN Universal Machine,the first stored program analog computing architecture,has shown to be an ideal hardware in various applications.It is designed to support complex analogic CNN algorithms,analog operations combined with local logic.In this paper,an analogic CNN algorithm is reported exploring the shortest path in flat,narrow labyrinths.A nonlinear" event-observer"is introduced as the key element of the algorithm. Possible applications in layout design of printed circuit boards and comparisons with different methods are briefly discussed.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) CNN Universal Machine / Analogic Algorithm / Shortest Path
Paper # NLP94-49
Date of Issue

Conference Information
Committee NLP
Conference Date 1994/9/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analogic CNN Algorithm Exploring the Shortest Path : Possible Applications in Routing Problems
Sub Title (in English)
Keyword(1) CNN Universal Machine
Keyword(2) Analogic Algorithm
Keyword(3) Shortest Path
1st Author's Name Csaba Rekeczky
1st Author's Affiliation Faculty of Engineering,University of Tokushima()
2nd Author's Name Akio Ushida
2nd Author's Affiliation Faculty of Engineering,University of Tokushima
3rd Author's Name Tamas Roska
3rd Author's Affiliation Hungarian Academy of Sciences
Date 1994/9/24
Paper # NLP94-49
Volume (vol) vol.94
Number (no) 259
Page pp.pp.-
#Pages 8
Date of Issue