Th& paper aims to p&ce neural networks in the conte.\t ol'booh'an citz'ldt complexit.l: 1,1~, de/itte aplm~priate classes qlfeedybrward neural networks with specified fan-in, accm'ac)' olcomputation and depth and ttsing techniques" o./commzmication comph:Β₯ity proceed to show t/tat the classes.fit in
β¦ LIBER β¦
Circuit complexity and neural networks: By Ian Parberry
β Scribed by J. L. van Hemmen
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 63 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Classes of feedforward neural networks a
β
John S. Shawe-Taylor; Martin H.G. Anthony; Walter Kern
π
Article
π
1992
π
Elsevier Science
π
English
β 594 KB
Unsolvability, complexity, and neural ne
β
E.V. Krishnamurthy
π
Article
π
1994
π
Elsevier Science
π
English
β 197 KB
Implementation of optical sensory neural
β
Bahram Nabet; Robert B. Darling
π
Article
π
1988
π
Elsevier Science
π
English
β 102 KB
A packet routing method for complex netw
β
Takayuki Kimura; Hiroyuki Nakajima; Tohru Ikeguchi
π
Article
π
2007
π
Elsevier Science
π
English
β 615 KB
We propose a new algorithm for controling packet routing by a neural network. First, we show that the conventional method for a packet routing control using a neural network is not so effective when it is applied to a network with irregular topology. To overcome this problem, we propose a modified m
A comparison study of binary feedforward
β
Hubertus M.A. Andree; Gerard T. Barkema; Wim Lourens; Arie Taal; Jos C. Vermeule
π
Article
π
1993
π
Elsevier Science
π
English
β 411 KB
Cervical screening by neural networks
β
Frable, William J.
π
Article
π
2001
π
John Wiley and Sons
π
English
β 45 KB