Author:
Arslanov Marat Z.,Amirgalieva Zhazira E.,Kenshimov Chingiz A.
Abstract
Abstract
In this paper ordered neural networks for the Nbit
parity function containing [log2(N + 1)] threshold elements
are constructed. The minimality of this network is
proved. The connection between minimum perceptrons of
Gamb for the N-bit parity function and one combinatorial
problems is established.
Subject
Electrical and Electronic Engineering,Mechanical Engineering,Aerospace Engineering,General Materials Science,Civil and Structural Engineering,Environmental Engineering
Reference9 articles.
1. Threshold Logic The;Dertouzos,1965
2. bit parity networks a simple solution Proceedings of the nd Annual Conference on Information and Systems Princeton University Princeton;Hohil;Sciences,1998
3. On the Solution of the Parity Problem by a Single Hidden layer Feedforward Neural Network;Setiono;Neurocomputing,1997
4. bit parity ordered networks;Arslanov;Neurocomputing,2002
5. parity networks;Brown;bit Neural Networks,1993
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献