Graph Problems and Connectionist Architectures
Mandalika B. Srinivas, Paul C. Gardner, D.H. Ballard · UR Research (University of Rochester)
This paper addresses several issues related to energy minimization algorithms. Several graph problems are reduced to a specific form of energy minimization which has a natural interpretation in terms of a binary multiprocessor machine. An update protocol is developed for this machine in which only a fraction r of the processors is concurrently active. Simulations using this protocol indicate that there might be an optimal value for r. Experimental results are presented for the performance of the protocol on the maximal independent set problem.