branch and bound model 中文意思是什麼

branch and bound model 解釋
分店模式
  • branch : n 1 （樹）枝〈泛指大枝或小枝；bough 特指大枝，也指連花、果折下的枝；limb 指大枝；twig 指小枝〉。2...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
  • model : n 1 模型，雛型；原型；設計圖；模範；（畫家、雕刻家的）模特兒；樣板。2 典型，模範。3 （女服裝店僱...
  1. Abstract : a cad tool based on a group of efficient algorithms to verify, design, and optimize power / ground networks for standard cell model is presented. nonlinear programming techniques, branch and bound algorithms and incomplete cholesky decomposition conjugate gradient method ( iccg ) are the three main parts of our work. users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed. the experimental results prove that the algorithms can run very fast with lower wiring resources consumption. as a result, the cad tool based on these algorithms is able to cope with large - scale circuits

    文摘:介紹了一個基於標準單元布圖模式的電源線/地線網路的輔助設計集成工具.它應用了一系列高效的演算法，為用戶提供了電源線/地線網路的設計、優化和驗證的功能.非線性優化技術、分枝定界演算法和不完全喬萊斯基分解的預優共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結果表明，文中所提供的演算法可以在很快的運行速度下實現更低的布線資源佔用.因此，在這些有效演算法基礎上實現的輔助設計工具具有處理大規模電路的能力
  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. Based on our extensive study of many different scheduling optimizations, we can summarize the results into five scheduling rules. based on the rules and the heuristics branch and bound algorithm we can obtain an optimal scheduling algorithm for both layers of our model

    根據不同生產方式優化調度研究成果得出了五個調度規則，應用這些規則與分枝定界方法分別構造出上、下層調度模型的啟發式分枝定界優化演算法。
  4. Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years. others are heuristic methods like genetic algorithm

    近年來求解選址模型用得較多的數學優化方法有分支定界法、混合整數規劃法、運輸模型法、可分離線性規劃法。
分享友人
分享到 Line

分享到臉書