dc.contributor.author |
Costea, Ruxandra L. |
|
dc.contributor.author |
Marinov, Corneliu A. |
|
dc.date.accessioned |
2020-04-08T15:41:44Z |
|
dc.date.accessioned |
2021-03-01T08:37:12Z |
|
dc.date.available |
2020-04-08T15:41:44Z |
|
dc.date.available |
2021-03-01T08:37:12Z |
|
dc.date.issued |
2008 |
|
dc.identifier.citation |
Costea, Ruxandra L.. Time-problem in Hopfield neural networks with parasitic capacitances. Timişoara: Editura Politehnica, 2008 |
en_US |
dc.identifier.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 |
|
dc.description.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. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Timişoara : Editura Politehnica |
en_US |
dc.relation.ispartofseries |
Seria electronică şi telecomunicaţii;Tom 53(67), fasc. 1 (2008) |
|
dc.subject |
Neural networks |
en_US |
dc.subject |
Winner-takes-all |
en_US |
dc.subject |
Hopfield networks |
en_US |
dc.subject |
Parasitics |
en_US |
dc.subject |
Time evaluations |
en_US |
dc.title |
Time-problem in Hopfield neural networks with parasitic capacitances [articol] |
en_US |
dc.type |
Article |
en_US |