Results 241 to 250 of about 224,803 (288)

Branch-and-Bound Algorithms

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

Constrained Branch-and-Bound algorithm for image registration

Journal of Zhejiang University-SCIENCE A, 2005
Summary: The authors propose a refined branch-and-bound algorithm for affine-transformation based image registration. Given two feature point-sets in two images respectively, the authors first extract a sequence of high-probability matched point-pairs by considering well-defined features. Each resultant point-pair can be regarded as a constraint in the
Jin, Jianqui, Wang, Zhangye, Peng, Qunsheng   +2 more
openaire   +1 more source

Hierarchical branch and bound algorithm for computational grids

Future Generation Computer Systems, 2012
Branch and Bound (B&B) algorithms are efficiently used for exact resolution of combinatorial optimization problems (COPs). They are easy to parallelize using the Master/Worker paradigm (MW) but limited in scalability when solving large instances of COPs on large scale environments such as computational grids.
Bendjoudi, Ahcène, Melab, Nouredine, Talbi, El-Ghazali   +2 more
openaire   +3 more sources

Genetic Branch-and-Bound or Exact Genetic Algorithm?

2008
Production resettings is a vital element of production flexibilityand optimizing the setup tasks scheduling within a productionchannel is required to improve production rate. This paper deals with aNP-Hard production resetting optimization problem based on an industrialcase.
Pessan, Cédric, Bouquard, Jean-Louis, Neron, Emmanuel   +2 more
openaire   +3 more sources

Branch and bound algorithm for the Bayes classifier

Proceedings of 13th International Conference on Pattern Recognition, 1996
Given 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   +2 more sources

A randomized parallel branch-and-bound algorithm

International Journal of Parallel Programming, 1988
Randomized 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.
Janakiram, Virendra K., Gehringer, Edward F., Agrawal, Dharma P., Mehrotra, Ravi   +3 more
openaire   +1 more source

A branch and bound clustering algorithm

IEEE Transactions on Systems, Man, and Cybernetics, 1995
We 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   +1 more source

Algorithmic Skeletons for Branch and Bound

2008
Algorithmic 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

Performance of parallel branch-and-bound algorithms

IEEE Transactions on Computers, 1985
We 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.
Lai, Ten-Hwang, Sprague, Alan
openaire   +1 more source

Branch-and-bound algorithms on a hypercube

Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988
The 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 ...
R. P. Pargas, D. E. Wooster
openaire   +1 more source