Abstract
Two learning algorithms for Discrete-Time Cellular Neural Networks (DTCNNs) are proposed, which do not require the a priori knowledge of the output trajectory of the network. A cost function is defined, which is minimized by Direct Search optimization methods and Simulated Annealing. Applications of the algorithms are presented in a companion paper.
| Original language | English |
|---|---|
| Pages | 165-170 |
| Number of pages | 6 |
| State | Published - 1994 |
| Event | Proceedings of the 3rd IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94) - Rome, Italy Duration: 18 Dec 1994 → 21 Dec 1994 |
Conference
| Conference | Proceedings of the 3rd IEEE International Workshop on Cellular Neural Networks and their Applications (CNNA-94) |
|---|---|
| City | Rome, Italy |
| Period | 18/12/94 → 21/12/94 |
Fingerprint
Dive into the research topics of 'Global learning algorithms for discrete-time cellular neural networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver