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

Stepwise-overlapped parallel annealing algorithm

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 $31
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)
Kim, Y. ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Kim, M.

A parallel simulated annealing algorithm for an effective implementation on multiprocessors is proposed. The new parallel annealing algorithm assigns Markov chains to each available processor and lets them generate stepwise-overlapped Markov chains simultaneously. Its major advantage is a simple communication pattern and thus less communication overhead.

Published in:

Electronics Letters  (Volume:25 ,  Issue: 16 )

Date of Publication:

3 Aug. 1989

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.