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
id sg-nus-scholar.10635-99596
record_format dspace
spelling sg-nus-scholar.10635-995962015-01-29T06:44:41Z Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units Setiono, Rudy Hui, Lucas Chi Kwong INFORMATION SYSTEMS & COMPUTER SCIENCE Proceedings of the International Joint Conference on Neural Networks 1 305-308 85OFA 2014-10-27T06:05:41Z 2014-10-27T06:05:41Z 1993 Conference Paper Setiono, Rudy,Hui, Lucas Chi Kwong (1993). 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 1 : 305-308. ScholarBank@NUS Repository. 0780314212 http://scholarbank.nus.edu.sg/handle/10635/99596 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
country Singapore
collection ScholarBank@NUS
description Proceedings of the International Joint Conference on Neural Networks
author2 INFORMATION SYSTEMS & COMPUTER SCIENCE
author_facet INFORMATION SYSTEMS & COMPUTER SCIENCE
Setiono, Rudy
Hui, Lucas Chi Kwong
format Conference or Workshop Item
author Setiono, Rudy
Hui, Lucas Chi Kwong
spellingShingle Setiono, Rudy
Hui, Lucas Chi Kwong
Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
author_sort Setiono, Rudy
title Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
title_short Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
title_full Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
title_fullStr Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
title_full_unstemmed Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
title_sort some n-bit parity problems are solvable by feed-forward networks with less than n hidden units
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/99596
_version_ 1681092218472890368

Similar Items