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
10.1145/42372.42378

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

0 Comments

No entries found

Purchase the Article

Computing with structured connectionist networks

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine