Showing results 1 to 2 of 2
| Title | Author(s) | Issue Date | |
|---|---|---|---|
Some n-bit parity problems are solvable by feed-forward networks with less than n hidden units Proceeding/Conference:Proceedings of the International Joint Conference on Neural Networks | 1993 | ||
Use of a quasi-Newton method in a feedforward neural network construction algorithm Journal:IEEE Transactions on Neural Networks | 1995 |