IEEE International Symposium on Circuits and Systems
DOI: 10.1109/iscas.1990.112175
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and synthesis of a class of discrete-time neural networks described on hypercubes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(30 citation statements)
references
References 11 publications
0
30
0
Order By: Relevance
“…Let A be a real n x n matrix, A -an interval matrix containing A, and A -, A + , A 0 and R A -the left end, the right end, the center and the radius of A, respectively (throughout the paper, bold face letters will be used to denote interval quantities while ordinary letters will stand for their non-interval counterparts). (8) where matrix H has the same structure defined by (5). It is seen from (8) that matrix Q is implicit function of A.…”
Section: Problem Statementmentioning
confidence: 99%
See 2 more Smart Citations
“…Let A be a real n x n matrix, A -an interval matrix containing A, and A -, A + , A 0 and R A -the left end, the right end, the center and the radius of A, respectively (throughout the paper, bold face letters will be used to denote interval quantities while ordinary letters will stand for their non-interval counterparts). (8) where matrix H has the same structure defined by (5). It is seen from (8) that matrix Q is implicit function of A.…”
Section: Problem Statementmentioning
confidence: 99%
“…First, we check condition (2) , (50) where matrix H II satisfies (4). We compute matrices H (according to (5)) and…”
Section: Stability Of the Central Problem Stability Analysis Of Systementioning
confidence: 99%
See 1 more Smart Citation
“…A storage algorithm that utilizes the eigenstructure method [8] is used for specifying the appropriate T and I parameter values that guarantee that patterns of concepts' combinations are stored as equilibrium points of the RSN (see [8] for a description of the algorithm). When two or more concepts are active in a pattern, i.e.…”
Section: The Connectionist Implementationmentioning
confidence: 99%
“…an equilibrium point. Thus, the RSN performs associate inference depending on the input pattern and, unlike the general use of an associative memory, it operates synchronously: (i) it updates the states of its nodes simultaneously, and (ii) the input pattern is kept unchanged until convergence of the network (see [8] for details on the network operation).…”
Section: The Connectionist Implementationmentioning
confidence: 99%