In this paper the identification of Boolean control networks is addressed. First, necessary and sufficient conditions are obtained for the identification of state equation from input-state data. Then a necessary and sufficient condition for a controllable Boolean network to be observable is presente
β¦ LIBER β¦
Sequences of memories in Boolean networks
β Scribed by Timothy L.H. Watkin; David Sherrington
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 210 KB
- Volume
- 185
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Identification of Boolean control networ
β
Daizhan Cheng; Yin Zhao
π
Article
π
2011
π
Elsevier Science
π
English
β 355 KB
Modeling pathways of differentiation in
β
Sheldon Dealy; Stuart Kauffman; Joshua Socolar
π
Article
π
2005
π
John Wiley and Sons
π
English
β 184 KB
π 2 views
On spectral techniques in analysis of Bo
β
Juha Kesseli; Pauli RΓ€mΓΆ; Olli Yli-Harja
π
Article
π
2005
π
Elsevier Science
π
English
β 180 KB
Frustration and stability in random bool
β
FranΓ§oise Fogelman-Soulie
π
Article
π
1984
π
Elsevier Science
π
English
β 876 KB
Evolution of Optimal Behaviour in Networ
β
Mark A. Beaumont
π
Article
π
1993
π
Elsevier Science
π
English
β 660 KB
Neural networks as models of associative
β
N. Parga
π
Article
π
1989
π
Elsevier Science
π
English
β 751 KB
Neural networks have proved to be useful models of associative memories. After a brief review of the standard Hopfield model we discuss how to introduce some realistic features such as categorization of the stored information and asymmetric synapsis.