Cart (Loading....) | Create Account
Close category search window

A new N-parallel updating method of the Hopfield-type neural network for N-queens problem

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)
Le, T.-N. ; Yasukawa Inf. Syst., Kitakyushu, Japan ; Cong-Kha Pham

In the previous N-parallel updating methods of the Hopfield-type neural network for N-queens problem, N×N neurons have been grouped into N groups. Each group composed of N neurons which are located in a same horizontal line (column) or in a same diagonal line. However, these method did not give convergence results of 100% in all size of N. Also, they required a large convergence time steps. In our work, we propose a new N-parallel updating method of the Hopfield-type neural network for N-queens problem, in which, a new grouping method for N neurons composed in the same group has been adopted. As a result, simulation results of the proposed method show a best performance than the previous generally.

Published in:

Neural Networks, 2005. IJCNN '05. Proceedings. 2005 IEEE International Joint Conference on  (Volume:2 )

Date of Conference:

31 July-4 Aug. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.