By Topic

Neural networks for the set covering problem: an application to the test vector compaction

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
$33 $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)
Aourid, M. ; Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada ; Kaminska, B.

A new neural network architecture is proposed and evaluated for the set covering problem. The network is designed by using the connections between nonlinear and integer programming problems. This connection is based on the concavity and penalty function methods. The general objective function obtained, which combines the objective function and constraints, is fixed as the energy of the system. The network obtained was then applied to a practical problem in VLSI systems. The simulation results for the network show that the system can converge rapidly within a few neural time constants even for large scale problems

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994