By Topic

Closed semiring optimization circuits using a connectionist approach

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

2 Author(s)
Tong, C.W. ; Dept. of Syst. Eng. & Eng. Manage., Chinese Univ. of Hong Kong, Shatin, Hong Kong ; Lam, K.P.

The closed semiring is an algebraic structure which unifies a family of path problems, including all-pairs shortest path, transitive closure and minimum spanning tree, defined on directed or undirected graphs. In resemblance to the dynamic programming formulation on closed semirings, we define a connectionist network architecture, called the binary relation inference network, to solve the problems represented. The extension and summary operators of closed semiring correspond to the site and unit functions of the network. But the network structure offers an obvious advantage of being simply extended for asynchronous and continuous-time operation. Analog circuits for the network are presented and simulation results are described, with particular reference to the minimum spanning tree problem

Published in:

Neural Networks, 1995. Proceedings., IEEE International Conference on  (Volume:1 )

Date of Conference:

Nov/Dec 1995