dc.contributor.author | Marroquin, J. L. | |
dc.date.accessioned | 2008-04-15T15:55:37Z | |
dc.date.available | 2008-04-15T15:55:37Z | |
dc.date.issued | 1983-07 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/41200 | |
dc.description.abstract | In this paper we analyse several approaches to the design of Cooperative Algorithms for solving a general problem: That of computing the values of some property over a spatial domain, when these values are constrained (but not uniquely determined) by some observations, and by some a priori knowledge about the nature of the solution (smoothness, for example).
Specifically, we discuss the use of: Variational techniques; stochastic approximation methods for global optimization, and linear threshold networks. Finally, we present a new approach, based on the interconnection of Winner-take-all networks, for which it is possible to establish precise convergence results, including bounds on the rate of convergence. | en |
dc.description.sponsorship | MIT Artificial Intelligence Laboratory | en |
dc.language.iso | en_US | en |
dc.publisher | MIT Artificial Intelligence Laboratory | en |
dc.relation.ispartofseries | MIT Artificial Intelligence Laboratory Working Papers, WP-253 | en |
dc.title | Design of Cooperative Networks | en |
dc.type | Working Paper | en |