By Topic

Solving four-coloring map problems using strictly digital neural networks

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

3 Author(s)
Murakami, K. ; Dept. of Inf. & Control Eng., Toyota Technol. Inst., Nagoya, Japan ; Nakagawa, T. ; Kitagawa, H.

A parallel algorithm with SDNNs (strictly digital neural networks) for solving four-coloring problems on combinatorial optimization problems is presented. This problem was defined as a set selection problem with the k-out-of-n design rule and was solved efficiently by an SDNN software simulator with the parallel algorithm. Solving this large problem with a sequential algorithm takes several hours. The simulation results of SDNN show that four-colour map problems can be solved not only within O(n) in parallel convergence but also O(n2) in sequential simulation, where n is the number of regions. A comparison with two other algorithms shows the efficiency of the SDNN algorithm

Published in:

Neural Networks, 1991. 1991 IEEE International Joint Conference on

Date of Conference:

18-21 Nov 1991