Home → Magazine Archive → February 1988 (Vol. 31, No. 2) → Computing with structured connectionist networks → Abstract

Computing with structured connectionist networks

By Jerome A. Feldman, Mark A. Fanty, Nigel H. Goddard, Kenton J. Lynne

Communications of the ACM, Vol. 31 No. 2, Pages 170-187

The design and applications of massively parallel computational models could lead to dramatic advances in the ability to automate complex tasks such as those found in artificial intelligence.

The full text of this article is premium content


No entries found