𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Unsolvability, complexity, and neural networks

✍ Scribed by E.V. Krishnamurthy


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
197 KB
Volume
7
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Complex neural networks
✍ Iku Nemoto; Tomoshi Kono πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 707 KB

## Abstract This paper proposes complex neural networks in the form of a perceptron and an autocorrelation associatron. Their properties are described and the results of computer simulation are presented. The discriminant power of the complex perceptron is nearly twice that of the real perceptron b

Classes of feedforward neural networks a
✍ John S. Shawe-Taylor; Martin H.G. Anthony; Walter Kern πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 594 KB

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

On the complexity of loading shallow neu
✍ Stephen Judd πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 898 KB

We formalize a notion of loading information into connectionist networks that characterizes the training of feed-forward neural networks. This problem is NPcomplete, so we look for tractable subcases of the problem by placing constraints on the network architecture. The focus of these constraints is

Networks and complexity
✍ D. R. White πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 37 KB
Neural network analysis of complex trait
✍ Paul R. Lucek; Jurg Ott πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 49 KB πŸ‘ 1 views

Neural networks are capable of simultaneously analyzing multiple loci at one time in order to identify patterns of loci involved in complex traits.