Optimal path finding with space- and time-variant metric weights via multi-layer CNN
- Author
- KIM, Hyongsuk1 2 ; SON, Hongrak2 ; ROSKA, Tamas3 ; CHUA, Leon O4
[1] University of California, Berkeley, United States
[2] Division of Electronics and Information Eng., Chonbuk National University, Chonju 561-756, Korea, Republic of
[3] Computer and Automation Research Institute of the Hungarian Academy of Sciences, 1518 Budapest, Hungary
[4] Department of EEECS, University of California, Berkeley, CA 94720, United States - Issue title
- CNN Technology
- Author (monograph)
- ROSKA, Tamás (Editor)1 ; RODRIGUEZ-VAZQUEZ, Angel (Editor)2
[1] Computer and Automation Research Institute, Budapest, Hungary
[2] Instituto de Microelectronica de Sevilla, Spain - Source
International journal of circuit theory and applications. 2002, Vol 30, Num 2-3, pp 247-270 ; ref : 16 ref
- CODEN
- ICTACV
- ISSN
- 0098-9886
- Scientific domain
- Electronics
- Publisher
- Wiley, Chichester
/
Wiley, New York, NY
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme optimal Chemin optimal Multicouche Réseau neuronal cellulaire Structure non linéaire Template Traitement parallèle Traitement temps réel Traitement variable dans espace Traitement variant dans le temps
- Keyword (en)
- Optimal algorithm Optimal path Multiple layer Cellular neural networks Non linear structure Template Parallel processing Real time processing Space variant processing Time varying processing
- Keyword (es)
- Algoritmo óptimo Camino óptimo Capa múltiple Estructura no lineal Tratamiento paralelo Tratamiento tiempo real Tratamiento variable en el espacio Tratamiento cronovariable
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D03 Electronics / 001D03G Electric, optical and optoelectronic circuits / 001D03G03 Neural networks
- Discipline
- Electronics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 13618616
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1002/cta.199 
https://dx.doi.org/10.1002/cta.199
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:9:\"\u0000*\u0000jtitle\";s:56:\"International journal of circuit theory and applications\";s:9:\"\u0000*\u0000stitle\";s:27:\"Int. j. circuit theory appl\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:3:\"2-3\";s:8:\"\u0000*\u0000spage\";s:3:\"247\";s:8:\"\u0000*\u0000epage\";s:3:\"270\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-9886\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"KIM\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Hyongsuk\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"SON, Hongrak\";i:1;s:12:\"ROSKA, Tamas\";i:2;s:12:\"CHUA, Leon O\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ICTACV\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:14:\"CNN Technology\";s:8:\"\u0000*\u0000title\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:8:\"\u0000*\u0000place\";s:10:\"Chichester\";s:6:\"\u0000*\u0000pub\";s:5:\"Wiley\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:9:\"\u0000*\u0000jtitle\";s:56:\"International journal of circuit theory and applications\";s:9:\"\u0000*\u0000stitle\";s:27:\"Int. j. circuit theory appl\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:3:\"2-3\";s:8:\"\u0000*\u0000spage\";s:3:\"247\";s:8:\"\u0000*\u0000epage\";s:3:\"270\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-9886\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"KIM\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Hyongsuk\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"SON, Hongrak\";i:1;s:12:\"ROSKA, Tamas\";i:2;s:12:\"CHUA, Leon O\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ICTACV\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:14:\"CNN Technology\";s:8:\"\u0000*\u0000title\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:8:\"\u0000*\u0000place\";s:10:\"Chichester\";s:6:\"\u0000*\u0000pub\";s:5:\"Wiley\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:9:\"\u0000*\u0000jtitle\";s:56:\"International journal of circuit theory and applications\";s:9:\"\u0000*\u0000stitle\";s:27:\"Int. j. circuit theory appl\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:3:\"2-3\";s:8:\"\u0000*\u0000spage\";s:3:\"247\";s:8:\"\u0000*\u0000epage\";s:3:\"270\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-9886\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"KIM\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Hyongsuk\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"SON, Hongrak\";i:1;s:12:\"ROSKA, Tamas\";i:2;s:12:\"CHUA, Leon O\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ICTACV\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:14:\"CNN Technology\";s:8:\"\u0000*\u0000title\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:8:\"\u0000*\u0000place\";s:10:\"Chichester\";s:6:\"\u0000*\u0000pub\";s:5:\"Wiley\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:9:\"\u0000*\u0000jtitle\";s:56:\"International journal of circuit theory and applications\";s:9:\"\u0000*\u0000stitle\";s:27:\"Int. j. circuit theory appl\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:3:\"2-3\";s:8:\"\u0000*\u0000spage\";s:3:\"247\";s:8:\"\u0000*\u0000epage\";s:3:\"270\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-9886\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"KIM\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Hyongsuk\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"SON, Hongrak\";i:1;s:12:\"ROSKA, Tamas\";i:2;s:12:\"CHUA, Leon O\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ICTACV\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:14:\"CNN Technology\";s:8:\"\u0000*\u0000title\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:8:\"\u0000*\u0000place\";s:10:\"Chichester\";s:6:\"\u0000*\u0000pub\";s:5:\"Wiley\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:15:\"10.1002\/cta.199\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:9:\"\u0000*\u0000jtitle\";s:56:\"International journal of circuit theory and applications\";s:9:\"\u0000*\u0000stitle\";s:27:\"Int. j. circuit theory appl\";s:7:\"\u0000*\u0000date\";s:4:\"2002\";s:9:\"\u0000*\u0000volume\";s:2:\"30\";s:8:\"\u0000*\u0000issue\";s:3:\"2-3\";s:8:\"\u0000*\u0000spage\";s:3:\"247\";s:8:\"\u0000*\u0000epage\";s:3:\"270\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0098-9886\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"KIM\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Hyongsuk\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:12:\"SON, Hongrak\";i:1;s:12:\"ROSKA, Tamas\";i:2;s:12:\"CHUA, Leon O\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"ICTACV\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:14:\"CNN Technology\";s:8:\"\u0000*\u0000title\";s:84:\"Optimal path finding with space- and time-variant metric weights via multi-layer CNN\";s:8:\"\u0000*\u0000place\";s:10:\"Chichester\";s:6:\"\u0000*\u0000pub\";s:5:\"Wiley\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
