Search Results - branch‐and‐prone algorithm

AB&B: An Anytime Branch and Bound Algorithm for Scheduling of Deadlock-Prone Flexible Manufacturing Systems by Luo, Jianchao, Zhou, Mengchu, Wang, Jun-Qiang

“… It proposes an anytime branch and bound (AB&B) algorithm for it to minimize system makespan based on the branch tree of a net model and a highly permissive deadlock controller…”
Get full text

Skeleton extraction of hard‐pen regular script based on stroke characterization and ambiguous zone detection by Xu, Zhanyang, Qin, Feiyang, Xiong, Ningyang, Shi, Hongyan, Zhang, Jiarui, Lin, Wei

“… The skeletons of Chinese characters extracted by traditional refinement algorithms are prone to redundant branches and deformed skeletons, which can lead to skeleton extraction results that do not…”
Get full text

Avoiding spurious submovement decompositions II: a scattershot algorithm by Rohrer, Brandon, Hogan, Neville

“… In previous work, a branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization, and hence, capable of avoiding spurious decompositions, was presented [Rohrer and Hogan (Biol Cybern 39:190-199, 2003…”
Get full text

Avoiding spurious submovement decompositions: a globally optimal algorithm by Rohrer, Brandon, Hogan, Neville

“… Examples of potential failures are given. A branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization…”
Get full text

Phase Unwrapping Method of Φ-OTDR System Based on Recursive-Branch-Cut Algorithm by Bai, Yu-xin, Lin, Ting-ting, Zhong, Zhi-cheng, Wu, Yong-peng

“… In this work, a two-dimensional phase unwrapping method based on the recursive-branch-cut (RBC) algorithm is proposed and studied to improve the accuracy of the demodulated phase waveform…”
Get full text

Efficient Algorithms for Moral Lineage Tracing by Rempfler, Markus, Lange, Jan-Hendrik, Jug, Florian, Blasse, Corinna, Myers, Eugene W., Menze, Bjoern H., Andres, Bjoern

“… Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances…”
Get full text

A Branch-and-Bound Algorithm for non-Integer Linear Programs with Fuzzy Right-Hand Side Coefficients by Elaibi, Waleed Mohammed, Rahi, AbdulRahim Khalaf, Majeed, Rajaa Kamil, Alhasan, Asmaa Adnan

“…One algorithm design paradigm that makes it possible to use the spatial features of problems to prone the state space is Branch and Bound (B&B…”
Get full text

Accelerated and Adaptive Power Scheduling for More Electric Aircraft Via Hybrid Learning by Xu, Bowen, Guo, Fanghong, Xing, Lantao, Wang, Yu, Zhang, Wen-An

“… Many model-driven methods, such as branch-and-bound algorithms, are advocated to solve…”
Get full text

Efficient Algorithms for Moral Lineage Tracing by Rempfler, Markus, Lange, Jan-Hendrik, Jug, Florian, Blasse, Corinna, Myers, Eugene W, Menze, Bjoern H, Andres, Bjoern

“… Their branch-and-cut algorithm, however, is prone to many cuts and slow convergence for large instances…”
Get full text

Elephant search algorithm applied to data clustering by Deb, Suash, Tian, Zhonghuan, Fong, Simon, Wong, Raymond, Millham, Richard, Wong, Kelvin K. L.

“… Partitioning-based type of clustering algorithms, such as K-means, is prone to the problem of producing a set of clusters that is far from perfect due to its probabilistic nature…”
Get full text

Globally convergent autocalibration by Benedetti, Busti, Farenzena, Fusiello

“…Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima…”
Get full text

ResNet50-Based Deep Learning Model for Early Detection and Classification of Mango Leaf Diseases by Jain, Eshika, Saini, Rajat

“… In this perspective, the research will seek to apply a class of Conv Net algorithms, a deep learning branch of artificial intelligence characterized by high accuracies realized…”
Get full text

Elephant search algorithm on data clustering by Zhonghuan Tian, Fong, Simon, Wong, Raymond, Millham, Richard

“… Partitioning-based type of clustering algorithms, such as K-means, is prone to the problem of producing a set of clusters that is far from perfect due to its probabilistic nature…”
Get full text