Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Fault-tolerance and learning performance of the back-propagation algorithm using massively parallel implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Murali, P. ; Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA ; Wechsler, H. ; Manohar, M.

Mapping the backpropagation (BP) algorithm onto an SIMD (single-instruction-stream, multiple-data-stream) machine, such as the Massively Parallel Processor, is considered. It is shown that the size of the connectionist network underlying BP can be scaled up to large sizes, resulting in improved performance. Specifically, both fault tolerance and learning speed can be enhanced

Published in:

Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the

Date of Conference:

8-10 Oct 1990