ideal constraints 中文意思是什麼

ideal constraints 解釋
理想約束
  • ideal : adj 1 理想的，典型的。2 觀念的；想像的；空想的；不切實際的。3 唯心論的；理想主義的。n 理想；典型...
  • constraints : 變動極限
  1. Slope - deflection equation with a type of non - ideal constraints at end of beam

    一類非理想桿端約束下的轉角位移方程
  2. The constraints to reputation game change from few limits to more limits, and from ideal situation to practical situation

    信譽博奕的約束條件由少到多，由理想狀態逐步過渡到現實狀態中。
  3. As a supplement to traditional detailed routing model it researches on detailed routing problem from a new point of view. using this detailed routing model can easily handle the cycle constraints in channel routing and interconnections of circuit modules which don ’ t border upon by transferring nets from layer to layer. by similar methods, channel area can be transformed into an ideal algorithm model to meet used channel routing algorithm and some error of global routing can also be amended

    和傳統通道布線模型相比，該模型復合採用通道布線層和區域布線層，通過層間線網轉移的方法，可以克服傳統通道布線演算法中處理循環約束問題和處理不相鄰模塊間互連問題的困難，還可以把通道區域處理為滿足各種通道布線演算法的理想模型，並且可以靈活處理一些總體布線中的不理想之處。
  4. The concepts presented in this lecture will consider an ideal world in which there are no constraints to the use of fertilizer

    這個講座所介紹的概念帶有理想化的色彩，也就是說，我們假設肥料的使用是沒有限制的。
  5. Space - time block coding is a new technique that combines coding, modulation and transmit diversity. it has been an ideal candidate for improving wireless communication performance and increasing data rates in systems with bandwidth constraints

    空時分組編碼是將編碼、調制和發射分集技術結合起來的一種新興技術，它是改善無線通信性能、提高帶限系統數據速率的一種理想的選擇。
  6. The algorithm ' s ideal is benint from the ideal of generalize projection technique and strongly subfeasible direction algorithm. it can be approximately describe as follows : firstly, by the introductin of a perturbed parameter / /, replace the complementarity constraints with a generalized function, then ( mpec ) can be reformulated equivalently nonlinear constraints programs. secondly. combine the ideal of strongly subfeasible direction algorithm and generalized projction tech - nique, we setup a generalized strongly subfeasible direction algorithm

    本學位論文結合廣義投影技術和強次可行方向法思想，建立一個新演算法，該演算法的主要思想大致可描述如下：首先引入一個趨向於0的參數，用一個互補函數代替性質不好的互補約束，將問題等價的轉化為一般的非線性約束最優化問題，然後結合廣義投影技術和強次可行方向法思想，建立一個廣義強次可行方向演算法
分享友人
分享到 Line

分享到臉書