lower bound algorithm 中文意思是什麼
lower bound algorithm
解釋
下界演算法-
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
文摘:介紹了一個基於標準單元布圖模式的電源線/地線網路的輔助設計集成工具.它應用了一系列高效的演算法，為用戶提供了電源線/地線網路的設計、優化和驗證的功能.非線性優化技術、分枝定界演算法和不完全喬萊斯基分解的預優共軛梯度法是該工作的三個主體部分.用戶可以選擇使用非線性規劃的方法或者幾種分枝定界方法來滿足他們對于精度和速度方面的不同需求.實驗結果表明，文中所提供的演算法可以在很快的運行速度下實現更低的布線資源佔用.因此，在這些有效演算法基礎上實現的輔助設計工具具有處理大規模電路的能力 -
For the non - preemptive version, we present a new lower bound 6 5 which improves the known lower bound 1. 161. for the preemptive version, we present an optimal semi - online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5 4 otherwise, while a lower bound 1. 0957 is also presented for general case
本文的主要結果為：對不可中斷的情況，我們給出了該問題的下界是6 5 ，從而改進了文獻中的給出的結果1 . 161 .對可中斷的情況，所謂工件加工允許中斷，即加工過程中允許機器暫停某工件的加工，而改為加工另一工件。 -
A branch and bound algorithm for solving a class of nonlinear 0 - 1 knapsack problems is proposed, in which branching is common 0 - 1 variables one and a better feasible solution is found by a simply integer heuristic method as well as a lower bound of the optimal value of the subproblem in the each branching node is determined by solving linear programming relaxed approximate problem to be obtained with linear relaxed technique
摘要構造出了一類可分離非線性0 - 1背包問題的分枝定界演算法，分枝的過程是普通的0 - 1變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。 -
4 ) an algorithm for reliability upper bound assessment of large - size network is presented, which is based on the principle of topological classification of node - set ; and the lower bound can be also obtained by dual graph of oriented network.
應用圖論的點集拓撲分類原理，提出一個計算大型復雜網路可靠度上界的類分法，並應用對偶理論求解網路可靠度的下界。 -
The at 2 scale based on the internal area - time lower bound of the viterbi decoder is analyzed. and the at 2 scales of three vlsi realization algorithms ( m - step decoder algorithm, flow and block decoder algorithm, and sliding block decoder algorithm ) are deduced. in succession, a fully new algorithm named ring - vd algorithm designed by ourselves is put forward, and its at 2 scale is also fetched
分析並推導了viterbi譯碼器基於內部信息流的vlsi面-時下界at2尺度;推導了已有的三種viterbi譯碼器的vlsi高速實現演算法（ m步譯碼演算法、流水式塊譯碼演算法和滑動塊譯碼演算法）的at2尺度;提出了一種新的環形vd演算法，並推導了它的at2尺度;對四種viterbi譯碼器的vlsi高速實現演算法進行了比較分析。 -
In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems, one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio, another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan, we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1. 6
第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。 -
By making algebraically equivalent transformation for the standard centering equation xs = e, we obtain a new system of perturbed k - k - t equations and, for specific power transformation, recover the newton equations that are recently used by j. m. peng et al to show a lower polynomial complexity bound for large - update algorithm
前述的兩種方法是針對擾動k一k一t系統進行的，而本文的另一種方法是採用ncp函數，直接將標準線性規劃k一k一t條件化為一個不含內點約束的等價方程組，以此改造標準攝動方程組。 -
The dynamic matrix control algorithms based on finite impulse response are studied. the model errors are defined in the form of upper and lower bound and the error square sum of impulse response coefficients of single - input / single - output systems. the robust stability conditions are proposed for closed - loop systems using dmc in the form of lmi, which can assure the closed - loop system using dmc algorithm to be asymptotically stable, when the coefficients of characteristic polynomial do n ' t satisfy jury ' s dominant coefficient lemma
浙江大學博士學位論文4 .研究了基於脈沖響應模型的動態矩陣預測控制田mc ）演算法，針對單輸入、單輸出系統可能出現的預測模型誤差，分別以脈沖響應系數上下界和脈沖響應系數誤差平方和的形式對預測模型的模型誤差進行定義，根據該定義以線性矩陣不等式的形式分別提出了閉環系統魯棒穩定判據，當閉環多項式系數不能滿足j切嘆主系數定理的情況下仍能保證系統閉環穩定。 -
For applying the hybrid optimization algorithm to solve the optimization problem with constraints, a self - adaptive penalty strategy for handling the constraints is designed, which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables
為了便於應用混合優化演算法對約束優化問題進行求解，設計了一種處理約束條件的自適應懲罰策略，用於將具有不等式約束和等式約束的優化問題轉變為僅包含決策變量上、下限約束的優化問題。 -
First we give some notations : where r lti : the load of the machine at step t ( i. e., immediately after the ith job has been scheduled ) optt : the current optimum makespan in step t ( for the job set { j1 ; …, jt } ) lbt : the lower bound of the length in step t for a set of jobs with processing times p1, …, pn, there are three straightforward lower bounds for the makespan of any preemptive schedule on m identical machines : max so we have lb = max ( 3. 2. 1 ) the algorithm will schedule jobs in such a way that, at any step t algorithm : a new job jt + 1 ( which arrives at time t + 1 ) is assigned as follows : step 1 compute the new lower bound lbi + 1 according to ( 3. 2. 1 ) step 2 research the following reserved intervals
需加工n個工件人； … ；人，每個工件是在線到達（ oneb ， olle ）且可打斷的，機器人人的準備時間為az ，怎樣安排加工順序，使工件的最大完工時間（ makespan ）盡可能地小，稱此問題為帶機器準備時間的平行機在線排序問題。它是帶機器準備時間的平行機排序和平行機在線排序問題的綜合和推廣；具有廣泛的應用背景。這里工件在線到達（ onebyone ）指的是工件的情況並不是提前知道的，只有將工件jj人安排完以後我們才能知道工jj的一些情況p工件的加工時間p 。
分享友人