鬆弛演算法 的英文怎麼說

中文拼音 [sōngchíyǎnsuànfǎ]
鬆弛演算法 英文
relaxation algorithm
  • 弛 : 動詞1. [書面語] （松開; 鬆懈） relax; loosen; slacken 2. （解除; 免除） fall off; fall out of use
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 鬆弛 : 1. （松; 不緊張） limp; flabby; slack; loose 2. （執行得不嚴格） lax
  1. Block relaxation algorithms in statistics. information systems and data analysis, bock h h, lenski w, richter m m eds.,

    為快速求解這一優化問題，本文給出了一種基於凸性邊界條件判別的塊鬆弛迭代演算法。
  2. An improved least - laxity - first scheduling algorithm for periodic tasks

    改進的最低鬆弛度優先周期任務調度演算法
  3. Image based walkthrough : an approach using a relaxing spidery mesh with two - vanishing points

    雙滅點的鬆弛蜘蛛網格演算法
  4. Parallel domain decomposition algorithm based on schwarz chaotic relaxation for die casting mold filling simulation

    混亂鬆弛法的壓鑄充型模擬并行分區演算法
  5. Based on the representation of interval rational bezier curves and surfaces and by a serial of mathematical transformation, the degree reductions of them are converted to those of polynomials with upper bounds, then several algorithms are presented, with linear programming and optimal approximation methods. by relaxation of some constrained conditions, approximation effects of some of them are further improved

    根據區間有理bezier曲線、曲面的特點，通過一系列數學變換，將其降階問題轉化為多項式的保上界降階逼近，再應用線性規劃和最優逼近方法求解，給出幾種逼近演算法，並探討通過約束不等式的鬆弛，進一步改進逼近效果。
  6. 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

    即使在和取定后，準鬆弛演算法的訓練和學習仍是一種局部最優化過程，它只是在初始權矩陣的附近找到第一個可行解就結束訓練，這類演算法並不能保證獲得全局最優解。
  7. On the relaxation factors of the parallel iterative domain decomposition method

    關于并行迭代區域分解演算法的鬆弛因子
  8. A discretization equation is derived by using a finite volume method in three - dimensional cylindrical polar coordinate system. algebraic equations are solved by iteration with a line - by - line method that is a combination of tdma in axial and radial directions, ctdma in tangential direction and adi method in three directions. the pressure and velocity coupling are solved with the simple algorithm

    在三維圓柱坐標下，利用有限體積法推導離散方程；在軸向與徑向用三對角矩陣法（ tdma ） ，在周向採用循環三對角矩陣法（ ctdma ） ，採用交替方向亞鬆弛疊代法（ adi ）求解方程；推導同位網格下的壓力修正方程，用simple演算法處理速度與壓力的耦合；為加速收斂，採用適當的鬆弛因子。
  9. 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變量分枝，用簡單的取整啟發式法確定更好的可行解；而在每個分枝結點處用線性鬆弛技術確定了它的子問題的一個線性規劃鬆弛逼近，由此得到最優值的一個下界。
  10. 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

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

    上的并行鬆弛迭代演算法
  12. The direct numerical simulation methods for turbulent spots in the channel, open - channel and boundary layer flows are built respectively. effective algorithms composed of time - advancing, over - relax iteration and multiple grid methods are planned to raise computational efficiency

    分別建立了適用於在槽道、明渠和平板邊界層流動中直接模擬湍斑的數值方法，並精心設計了時間推進、超鬆弛迭代和多重網格等高效演算法，以提高計算效率。
  13. 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和連接權方差之商為個體適應度函數，並應用準鬆弛方法來調整不滿足約束條件的個體。
  14. Relaxation algorithms for adaptive power allocation in multiuser ofdm systems with proportional fairness requirement

    系統自適應功率分配鬆弛演算法
  15. Self - adaptive lagrange relaxation algorithm for aggregated multicast multicast has great advantages in data forwarding

    解決聚合組播的自適應拉格朗日鬆弛演算法
  16. This paper analyzes the sensitivity to noise in bam bidirectional associative memory, and then proves the noise immunity of bam relates not only to the minimum absolute value of net inputs but also to the variance of weights associated with synapse connections

    雙向聯想記憶網路的進化準鬆弛演算法eprbam雙向聯想記憶網路bam因其結構簡單並且具有和人腦相似的聯想記憶功能而備受關注，並在模式識別領域得到了應用。
  17. 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 ）演算法等經典演算法。
  18. In siggraph 91 : proc. the 18th annual conference on computer graphics and interactive techniques, acm press, new york, usa, 1991, pp. 299 - 308

    傳統的鬆弛演算法會在每一步對模型表面上的所有細胞進行鬆弛計算稱為全局鬆弛。
  19. The fbc for connecting the subdomains on fictitious boundary is developed according to the actual field distribution in the waveguide to ensure the propagation of waves between adjacent subdomains. the relaxed algorithm is introduced to improve the iterative convergence

    文中從實際場分佈出發，在劃分區域的虛擬邊界上給出了連接子域的吸收虛擬邊界條件，並通過引入鬆弛演算法，構建了一種能夠用於分析波導問題的鬆弛迭代區域分解法。
  20. The convergence of the waveform relaxation for solving functional differential - algebraic equations is studied and the error estimate is derived

    摘要本文採用波形鬆弛演算法來求解一類泛函微分代數系統，該演算法在迭代過程中，避免了求解泛函微分方程，且利於并行處理。
分享友人
分享到 Line

分享到臉書