Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units

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:
Bibliographic Details
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
Description
Summary:Proceedings of the International Joint Conference on Neural Networks

Similar Items