Results 211 to 220 of about 25,776 (266)
Some of the next articles are maybe not open access.
Branch-and-bound algorithms on a hypercube
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988The parallel implementation of branch-and-bound algorithms on multiprocessors has received an increasing amount of attention in recent years. This paper describes research currently being conducted at Clemson University. We study the job scheduling problem: given n jobs, each with processing time, pi, and due date, di, schedule these jobs on a single ...
Roy P. Pargas, D. E. Wooster
openaire +2 more sources
Parallel branch-and-bound algorithms
Future Generation Computer Systems, 1989Abstract In this paper a parallel algorithm for branch-and-bound problems is sketched. It is designed to run on MIMD machines and exploits coarse grain parallelism. Due to the irregular and unpredictable behavior of branch-and-bound algorithms, it is hard to obtain a good load-balance.
J. M. Jansen, F. W. Sijstermans
openaire +2 more sources
Performance of parallel branch-and-bound algorithms
IEEE Transactions on Computers, 1985We study the performance of parallel best-bound-first branch-and-bound algorithms, in which several nodes with least lower bounds are expanded simultaneously. It is well known that anomalies may occur in the execution of a parallel branch-and-bound algorithm.
Ten-Hwang Lai, Alan P. Sprague
openaire +3 more sources
Branch and bound algorithm for the Bayes classifier
Proceedings of 13th International Conference on Pattern Recognition, 1996Given the feature vector from an unknown class, the branch and bound algorithm (BAB) is very efficient for finding the nearest neighbor among the set of reference vectors. The Euclidean distance measure is adopted. In this article, the BAB algorithm is extended so that it can be used with the Bayes classifier which uses the probability measure instead ...
Sze, L, Leung, CH
openaire +3 more sources
Algorithmic Skeletons for Branch and Bound
2008Algorithmic skeletons are predefined components for parallel programming. We will present a skeleton for branch & bound problems for MIMD machines with distributed memory. This skeleton is based on a distributed work pool. We discuss two variants, one with supply-driven work distribution and one with demand-driven work distribution.
Michael Poldner, Herbert Kuchen
openaire +1 more source
A randomized parallel branch-and-bound algorithm
International Journal of Parallel Programming, 1988Randomized algorithms are algorithms that employ randomness in their solution method. We show that the performance of randomized algorithms is less affected by factors that prevent most parallel deterministic algorithms from attaining their theoretical speedup bounds.
Virendra K. Janakiram +3 more
openaire +2 more sources
Paradigms for the parallelization of Branch&Bound algorithms
1996Branch&Bound (B&B) algorithms represent a typical example of techniques used to solve irregularly structured problems. When porting sequential B&B applications to a network of workstations, a very popular class of MIMD distributed memory machines, several issues have to be coped with, such as sharing a global computation state and balancing workload ...
DI MARTINO B. +2 more
openaire +3 more sources
A Branch-Bound Algorithm for Plant Location
Operations Research, 1966This paper discusses an integer-programming method for solving a special class of discrete programming problems called plant location. The basic contribution is that the problem is formulated as an integer program in such a way that the associated continuous problem can be efficiently optimized.
M. A. Efroymson, T. L. Ray
openaire +2 more sources
A branch and bound clustering algorithm
IEEE Transactions on Systems, Man, and Cybernetics, 1995We discuss the clustering problem in a 0-1 matrix in this paper. Although clustering algorithms are available in the literature, many of them cannot produce a solution matrix in a desirable structure. Therefore, additional computation or user intervention is required to obtain submatrices (i.e., clusters) from a solution matrix. To solve the clustering
openaire +2 more sources
1984
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
A solution technique for discrete optimisation problems which is widely used outside Al and is closely related to the A* algorithm . The task is to find the optimally valued tip of a walkable search tree. A subtree of the search tree need not be searched if a computation at its root yields a bound for its set of tip values which implies that none of ...
Alan Bundy, Lincoln Wallen
openaire +1 more source