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

Parallel implementations of a branch-and-bound algorithm for the optimization of distributed database computer 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

5 Author(s)

The arrival of parallel processing architectures has generated considerable interest in mapping conventional sequential jobs onto the new machines (multiprocessor arrays). The problem is in finding and exploiting the parallelism in a given task. The authors outline some important findings on a branch-and-bound algorithm and how it was modified to run on a multiprocessor network of Transputers.<>

Published in:

IEEE Region 5 Conference, 1988: 'Spanning the Peaks of Electrotechnology'

Date of Conference:

21-23 March 1988

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.