By Topic

The upper bound neural network and a class of consistent labeling problems

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

1 Author(s)
Carlson, R. ; Dept. of Math. Sci., Clemson Univ., SC, USA

The upper bound neural network (UBNN) is proposed for solving a class of consistent labeling problems (CLP). Crossbar switching is used as an illustration. The set of stable attractors of the dynamical system is identically the set of feasible solutions to the problem. CLP is a general class of NP-complete (Neyman-Pearson) problems intersecting artificial intelligence, symbolic logic, and operations research. Problems which can be formulated as CLP include image segmentation as well as finding spanning trees and Euler tours in a graph. As an example, the UBNN is used to control a crossbar packet switch. The switch control problem is a maximal matching problem which is approximated by the UBNN. As switching speeds push below the nanosecond range, the O(V3) time complexity of the maximal matching problem will be prohibitive for large switches. When viewed as an analog circuit, the UBNN scales well, guarantees convergence to a solution of the problem, and converges in near constant time, thus becoming an alternative for large crossbar switch control

Published in:

Neural Networks, IEEE Transactions on  (Volume:6 ,  Issue: 5 )