Results 241 to 250 of about 35,838 (299)
Some of the next articles are maybe not open access.
A Branch-and-Bound Algorithm for Pagination
Operations Research, 1975The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a ...
John Duncan, Lawrence W. Scott
openaire +2 more sources
A Branch and Bound Clustering Algorithm
IEEE Transactions on Computers, 1975The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization.
Warren L. G. Koontz +2 more
openaire +3 more sources
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
An asynchronous parallel branch‐and‐bound algorithm
Systems and Computers in Japan, 1992AbstractThis paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being synchronized.
Tsuyoshi Kawaguchi +2 more
openaire +2 more sources