Results 231 to 240 of about 224,803 (288)

Competition between radiative and predissociative decay mechanisms in excited electronic states of CH radical.

Phys Chem Chem Phys
Sokolov A, Yurchenko SN, Tennyson J.
europepmc   +1 more source

Parallel branch and bound algorithms- an overview

, 1989
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Branch and Bound Clustering Algorithm

IEEE Transactions on Computers, 1975
The 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.
Koontz, Warren L. G., Narendra, Patrenahalli M., Fukunaga, Keinosuke   +2 more
openaire   +4 more sources

A Branch and Bound Algorithm for Feature Subset Selection

IEEE Transactions on Computers, 1977
A 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
Narendra, Patrenahalli M., Fukunaga, Keinosuke   +1 more
openaire   +3 more sources

Parallel branch-and-bound algorithms

Future Generation Computer Systems, 1989
Abstract 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   +1 more source

Embedding Branch and Bound within Evolutionary Algorithms

Applied Intelligence, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cotta, Carlos, Troya, José M.
openaire   +2 more sources

A Branch-and-Bound Algorithm for Pagination

Operations Research, 1975
The 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 ...
Duncan, John, Scott, Lawrence W.
openaire   +1 more source