Results 241 to 250 of about 178,189 (288)
Some of the next articles are maybe not open access.
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
Constrained Branch-and-Bound algorithm for image registration
Journal of Zhejiang University-SCIENCE A, 2005Summary: 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 +2 more
openaire +1 more source
Hierarchical branch and bound algorithm for computational grids
Future Generation Computer Systems, 2012Branch 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 +2 more
openaire +3 more sources
Genetic Branch-and-Bound or Exact Genetic Algorithm?
2008Production 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 +2 more
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 +2 more sources
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
Operations Research, 1994We present a detailed and up-to-date survey of the literature on parallel branch-and-bound algorithms. We synthesize previous work in this area and propose a new classification of parallel branch-and-bound algorithms. This classification is used to analyze the methods proposed in the literature.
Gendron, Bernard +1 more
openaire +2 more sources
Dual bounding procedures lead to convergent Branch–and–Bound algorithms
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
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.
Janakiram, Virendra K. +3 more
openaire +1 more source
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 +1 more source
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