Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
Proceedings of the International Joint Conference on Neural Networks
Saved in:
Main Authors: | Setiono, Rudy, Hui, Lucas Chi Kwong |
---|---|
Other Authors: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/99596 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the solution of the parity problem by a single hidden layer feedforward neural network
by: Setiono, R.
Published: (2014) -
On solvable septics
by: LAU JING FENG
Published: (2010) -
Solvable trees
by: Gervacio, Severino V., et al.
Published: (2008) -
Lights out puzzle: Number of solvable states of some classes of graphs
by: Ngo, Johanna Joyce C., et al.
Published: (2008) -
Solvable join of graphs
by: Gervacio, Severino V., et al.
Published: (2006)