基本解釋[計算機(jī)科學(xué)技術(shù)]分支與界限策略英漢例句雙語例句Branch and bound strategy is used to optimize the local problem.該算法應(yīng)用分枝定界法實(shí)現(xiàn)局部問題的優(yōu)化。This paper presents a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.因此，我們?yōu)槠湓O(shè)計了一個多項(xiàng)式時間的貪心算法以及一個將貪心策略和分支限界策略集合在統(tǒng)一框架下的復(fù)合算法。Also developed for the PRA tree is an enhanced predictive range aggregate (EPRA) query algorithm which uses a more precise branch and bound searching strategy, reducing the disk I?提出了一種增強(qiáng)預(yù)測范圍聚集查詢EPRA算法，采用更精確的剪枝搜索準(zhǔn)則，減少了查詢所需要訪問的節(jié)點(diǎn)代價。branch and bound strategy更多例句詞組短語短語branch -and-bound solution strategy 分支限界解法branch and bound strategy更多詞組專業(yè)釋義計算機(jī)科學(xué)技術(shù)分支與界限策略