branch-and-bound search 中文意思是什麼

branch-and-bound search 解釋
分枝限界搜索
  • branch : n 1 （樹）枝〈泛指大枝或小枝；bough 特指大枝，也指連花、果折下的枝；limb 指大枝；twig 指小枝〉。2...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  1. A great significance of this article is that it changes the branch and bound algorithm and backtracking algorithm into application examples of the generic search algorithm of optimal problems advanced in this article

    本文的一個重要意義是將回溯法和分支限界法這兩個傳統的演算法策略轉變為本文所提出的通用搜索演算法的應用例子。
  2. This paper presents an approach to perceptually extract multi - oriented text lines from online handwriting. the approach adopts a bottom - up strategy. by the approach, strokes are first merged into blocks analogous to words, then a link model is constructed upon these blocks. finally, the optimal text line layout is found out by a branch - bound search on the link model. the experimental results show that the approach is effective and also available to extract curved text lines

    提出一種多方向手寫筆跡文本行的提取方法.該方法以視覺感知理論為基礎，採取自底向上的策略，先將筆畫組合成類比字元的筆畫塊，然後基於這些筆畫塊建立鏈接模型，最後採用分支限界搜索演算法從鏈接模型中找出最優行排列.實驗結果表明，該方法能有效地提取多方向筆跡行結構，並適用於彎曲文本行的提取
  3. Searching of the state space is always being one of the usual ways for solving the optimal problems. the traditional ways of finding solutions only have backtracking, branch - and - bound and implicit graphs search as their theoretical introduction

    狀態空間搜索是解決優化問題的常用方法之一，傳統的狀態空間搜索求解技術有回溯法和分支限界法以及隱式圖搜索這些演算法策略作為理論指導。
  4. Branch - and - bound search

    分支限界搜索
分享友人
分享到 Line

分享到臉書