relaxation algorithm 中文意思是什麼

relaxation algorithm 解釋
鬆弛演算法
  • relaxation : n. 1. （精神等的）鬆弛；放鬆；【物理學】張弛；弛豫。2. （刑罰等的）減輕，放寬。3. 休養，休息，解悶，娛樂。4. 鬆懈；寬舒；緩和。5. 衰弱，精力減退。
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Parallel domain decomposition algorithm based on schwarz chaotic relaxation for die casting mold filling simulation

    混亂鬆弛法的壓鑄充型模擬并行分區演算法
  2. As an application of succeeding, a numerical example of max - cut is given. 3. several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated. rounding, coordinate descent, cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution

    本文紿出了基於半定規劃模型尋求多用戶檢測問題次優解的幾種重要方法，包括隨機擾動法、坐標下降法、半定規劃的割平面法和二次規劃的分枝定界法等
  3. A revised fuzzy control algorithm was developed to accelerate iteration convergence in numerical fluid dynamic simulation by adjusting the value of the under - relaxation factor

    摘要在原來研究工作的基礎上，提出了一種改進的模糊控制方法，用以調整粘性流場迭代計算中亞松馳因子的值。
  4. And it is obvious that pseudo - relaxation is a kind of local optimization method, so it cannot guarantee to get the global optimal solution. in this paper, a novel learning algorithm eprbam evolutionary psendo - relaxation learning algorithm for bidirectional association memory employing genetic algorithm and pseudo - relaxation method is proposed to get feasible solution of bam weight matrix

    即使在和取定后，準鬆弛演算法的訓練和學習仍是一種局部最優化過程，它只是在初始權矩陣的附近找到第一個可行解就結束訓練，這類演算法並不能保證獲得全局最優解。
  5. Abstract : in this paper, we propose an improved lagrangian relaxation algorithm to solve job - shop scheduling problems. besides the addition of augmented objective, we expand the search scope of near - optimal solutions and improve the computational efficiency greatly by restricting the solution scope of sub - problems and modifying the search method of dual problem. at the same time, we develop a genetic algorithm combining with the lr ( lagrangian relaxation ) method. using the numerous useful solutions we get in the lagrangian relaxation as the original genes, we can improve the solution further. test results show that these methods achieve satisfied outcome for job - shop problems. they can also be applyed to other programming problems with constraints

    文摘:針對車間調度問題，提出了一種改進的拉氏鬆弛演算法.在增加輔助目標函數的基礎上，通過對子問題的限制和搜索策略的改變，使拉氏演算法的計算量減少，近優解的搜索能力有很大改善.本文還提出了一種基因優化演算法，充分利用拉氏演算法得到的多個近優解，進一步優化結果.模擬結果表明對車間調度問題得到了較好的結果.本方法也可用於其它有約束的規劃問題
  6. Parallel relaxation iteration algorithm on mpp

    上的并行鬆弛迭代演算法
  7. This algorithm uses the quotient as the fitness of each individual and employs pseudo - relaxation method to adjust individual solution when it does not satisfy constraining condition any more after genetic operation

    這種方法應用遺傳演算法和準鬆弛方法來得到bam的可行解，以mav和連接權方差之商為個體適應度函數，並應用準鬆弛方法來調整不滿足約束條件的個體。
  8. A strength relaxation of semidefinite programming for standard quadratic optimization problems is given. the relaxation is transformed to a semi - indefinite programming. a linear programming cutting plane algorithm is proposed

    3 .給出標準二次優化問題的一個強化半定規劃鬆弛模型，把該模型轉化為半不定的線性規劃問題，並提出線性規劃的一種新的割平面演算法解該問題，理論和數值實驗證明了演算法的有效性
  9. Self - adaptive lagrange relaxation algorithm for aggregated multicast multicast has great advantages in data forwarding

    解決聚合組播的自適應拉格朗日鬆弛演算法
  10. Perceptron, relaxation, mse and ho - kashyap ( hk ) algorithm. hk is not robust to outliers. the modified hk with square approximation of the misclassification errors ( mhks ) tries to avoid this shortcoming and adopts similar principle to the support vector machine to maximize the separation margin

    線性分類器因其簡單、易於分析和實現且容易推廣為非線性分類器的優點而成為模式分類最常用的分類器，並產生了感知器（ perceptron ） 、鬆弛演算法（ relaxation ） 、最小平方誤差（ minimumsquareerror ， mse ）和ho - kashyap （ h - k ）演算法等經典演算法。
  11. Then a suboptimal solution of the graph maximum equal - cut problem is presented employing the randomized algorithm and the improved coordinate ascent ( descent ) algorithm on the optimal solution of semidefmite relaxation

    在利用lagrange乘子理論得出原始問題的等價形式之後，將近似演算法與改進的坐標上升（下降）演算法結合，求得原問題的次優解。
  12. * the sixth chapter presents a tool wear area image segmentation algorithm based on markov random field m odel. the refresh formula of relaxation labeling is deduced. with the algorithm, the segmentation result composed of wear area, background area and tool body area is obtained according to the map ( maximum a posterior ) criterion

    第六章以馬爾可夫隨機場理論為基礎，提出刀具磨損區域分割演算法，推導了鬆弛迭代更新公式，並用該方法對圖像分割問題進行求解，獲得了map準則下將刀具圖像的分割結果。
  13. This thesis gives a model language and a moderately complete formal description which can be used to prove the properties of static and dynamic data dependencies, and defines the notions in the iterative relaxation method formally. the program theories about the iterative relaxation method and its improvement are investigated, whose results include : the generalization of the predicate slices proposed by neelam gupta et al to path - wise static slices, and the proofs of the soundness of the construction algorithm of path - wise static slices and the soundness of the improvement

    本文給出一種模型語言；給出一個比較完整的形式化描述，該描述可用於證明與靜態、動態數據依賴關系有關的程序性質；給出迭代鬆弛法中各概念的形式化定義；深入研究迭代鬆弛法及其改進后的方法的程序理論，其結果包括：將neelamgupta等人提出的謂詞片推廣為路徑靜態切片，證明路徑靜態切片構造演算法的正確性，證明改進后的方法與原方法所生成的線性約束系統相同。
  14. An equivalent integral programming model and a new semidefinite programming relaxation for the max - bisection problem are given. then, we solve the relaxation with a projected gradient algorithm. coupled with the randomized method, an approximate solution of the max - bisection problem is obtained

    2 .給出圖的最大二等分問題的整數規劃模型的等價模型及其新的半定規劃鬆弛模型，利用投影梯度演算法求解該半定規劃鬆弛模型，然後利用隨機擾動演算法求得原問題的次優解
  15. The approach of constraint relaxation and adjusting tank level achieving from upper level was proposed to avoid unfeasible solutions of lower - level optimal model. hierarchic genetic algorithm ( hga ) was established to solve direct optimal operation model of system with tanks. hga is appropriate for optimal model including multi - constraints and multi - variants

    對含有蓄水池供水系統的直接優化調度模型，本文結合遺傳演算法的特點，提出分層遺傳演算法優化的思路，並建立了適合遺傳演算法求解的第一層、第二層優化模型，可以有效解決變量和約束多的城市供水系統直接優化調度問題。
  16. Involving interaction of gasket, bolts and flange rings, the load - deformation and the structural fuzzy reliability of each component are analyzed in the case of ideality, external loads and creep - relaxation respectively. and then, the sealing fuzzy reliability of the flanged connection system is researched. the function of each part of genetic algorithm is analyzed in application to nonlinear unconstrained and constrained optimization

    本文將墊片、螺栓和法蘭作為一個相互作用的整體，比較深入地分析了理想情況下、有外載作用及蠕變-鬆弛影響下，平墊片和0形圈這兩種典型的火箭發動機法蘭連接系統各元件的載荷與變形、元件的結構可靠度和火箭發動機法蘭系統的密封可靠度。
分享友人
分享到 Line

分享到臉書