Results 251 to 260 of about 35,838 (299)
Some of the next articles are maybe not open access.
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
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Normand, Jean-Marie +3 more
openaire +5 more sources
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carlos Cotta, José M. Troya
openaire +3 more sources
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 +4 more sources
A parallel branch and bound algorithm for test generation
Proceedings of the 1989 26th ACM/IEEE conference on Design automation conference - DAC '89, 1989For circuits of VLSI complexity, test generation time can be prohibitive. Most of the time is consumed by hard-to-detect (HTD) faults, which might remain undetected even after a large number of backtracks. The problems inherent in a uniprocessor implementation of a test generation algorithm are identified, and a parallel test generation method which ...
Srinivas Patil, Prithviraj Banerjee
openaire +1 more source
A Branch and Bound Algorithm for Feature Subset Selection
IEEE Transactions on Computers, 1977A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is
Patrenahalli M. Narendra +1 more
openaire +2 more sources
Evaluation of a Branch and Bound Algorithm for Clustering
SIAM Journal on Scientific and Statistical Computing, 1985From author's summary: A branch and bound algorithm for optimal clustering is developed and applied to a variety of test problems. The objective function is minimization of within-group sum-of-squares although the algorithm can be applied to loss functions which meet certain conditions.
openaire +1 more source
Tolerance-based Branch and Bound algorithms for the ATSP
European Journal of Operational Research, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcel Turkensteen +3 more
openaire +4 more sources
Are Branch and Bound and A* Algorithms Identical?
Journal of Heuristics, 2003Heuristic Search and Branch and Bound algorithms have many similarities. In this paper, we address the question of the extent to which they are similar. We firstly show that these algorithms apply the same principles, although generating graphs with different properties: Heuristic Search can explore any kind of graphs, whereas the Branch and Bound ...
Labat, Jean-Marc, Pomerol, Jean-Charles
openaire +2 more sources