Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1488| Title: | Time-problem in Hopfield neural networks with parasitic capacitances [articol] |
| Authors: | Costea, Ruxandra L. Marinov, Corneliu A. |
| Subjects: | Neural networks Winner-takes-all Hopfield networks Parasitics Time evaluations |
| Issue Date: | 2008 |
| Publisher: | Timişoara : Editura Politehnica |
| Citation: | Costea, Ruxandra L.. Time-problem in Hopfield neural networks with parasitic capacitances. Timişoara: Editura Politehnica, 2008 |
| Series/Report no.: | Seria electronică şi telecomunicaţii;Tom 53(67), fasc. 1 (2008) |
| Abstract: | A continuous time neural network of O(N2 ) interconnections is considered. A maximum selector is built by a proper choosing of parameters. It processes a sequence of lists and the speed is a performance criterion. The main point here is a formula for the processing time which takes into account the parasitic capacitances between inputs. |
| URI: | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Time-problem%20in%20Hopfield%20neural%20networks%20with%20parasitic%20capacitances&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo |
| Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BUPT_ART_Costea_f.pdf | 463.3 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.