convergent algorithm 中文意思是什麼

convergent algorithm 解釋
收斂演算法
  • convergent : adj. 1. 漸集一點的，會聚性的；包圍集中的。2. 【數學】收斂的。n. 【數學】收斂子；漸近分數。
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. A globally convergent algorithm for solving bilevel linear programming

    二層線性規劃問題的全局收斂演算法
  2. A globally convergent algorithm for solving the bilevel linear programming problem

    雙層線性規劃的一個全局優化方法
  3. Both theoretical proof and numerical experiments indicate that this algorithm is convergent and effective for solving large - scale semidefinite programming. in the following section, we work over the bisection problems

    數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。
  4. The new algorithm bases on bisection and secant iteration, which is different cuppen ' s method and newton iteration. the results of theoretical analysis and numerical testing show that convergent rant of our algorithm is obviously faster that of the classical algorithm

    該演算法以割線法迭代為基礎，明顯不同與傳統的newton迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好
  5. Linear convergent rate of algorithm tr

    一種非光滑優化演算法收斂速度的估計
  6. Globally convergent of a trust region algorithm with memory

    帶記憶信賴域方法的收斂性分析
  7. In the algorithm, the concept is more clearly and more perspicuous. simulation results show the algorithm has more rapid convergent speed and high fitting precision

    該方法概念更加清晰，透明性強，模擬結果也表明了其有較強的收斂和逼近性能。
  8. Wang guangmin, wang xianjia, wan zhongping, a globally convergent algorithm for a class of bilevel nonlinear programming problem, applied mathematics and computation, 2007, 188 : 166 - 172

    王廣民，王先甲，萬仲平，二層線性規劃的自適應遺傳演算法， （投應用數學與力學）
  9. Considering of the differences of task scheduling between a grid and a distributed system, this dissertation designs a real number encoded mode that mapping every task to a random resource directly by improving the encoding mode of the traditional genetic algorithm, and gives a particular design to the encoding and decoding mode. at last, this algorithm is simulated in the grid simulator. the experiment results show that the reformative genetic algorithm not only has a holistic searching ability, but also makes a fast convergent speed, which provides a preferable performance

    本文根據網格計算任務調度的特點，提出了基於改進的遺傳演算法的網格任務調度，通過對傳統遺傳演算法的編碼方式進行改進，針對網格任務調度與一般分散式系統任務調度的不同之處，設計了資源?任務的一一對應的實數編碼方法，詳細設計了其編碼及解碼方式，最後在網格模擬器中進行了模擬，實驗數據證明了改進后的遺傳演算法即具有全局搜索能力，又具有較快的收斂速度，具有較好的性能，該實驗達到了本文以實現任務調度的最優跨度為目標的實驗目的。
  10. Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  11. So, according to the characteristics of resource allocation problem, this paper gives the iterating algorithm by means of piecewise linearization. the algorithm is proved to be convergent

    因此，本文根據資源分配問題的特點，設計了適合於應用分解協調技術的逐點線性化迭代演算法，並證明了演算法的收斂性
  12. Its encoding way is also analyzed in this paper. we adopt sa to produce the initial packing, which ensure the parent generations are choiceness. the crossover ( pc ) can prevent the fitness individual to be abandoned, the probability of mutation ( pm ) can prevent the algorithm is convergent before premature

    文中對其編碼方式進行分析，採用模擬退火法產生初始布局，保證了父輩解群的優良性，採用交叉概率pc有效地防止具有高適應度值的個體被排擠掉，變異概率pm防止了搜索在成熟前收斂。
  13. To make further study on the optimization capability of iga and other correlative capabilities mathematically, stochastic theory is used to analyze iga. as a result, the global convergence of iga and other correlative characteristics are got. meanwhile, the convergent effect and the mechanism on prevention from premature of iga is studied so that the effectiveness and the superiority of the algorithm proposed in the dissertation are proved theoretically

    為了從數學角度更加深入地分析iga的優化能力及相關性能，利用隨機過程理論對iga進行分析，並證明了iga的全局收斂性及其他相關性質，還對iga的收斂效果以及對早熟的防治機理進行了研究，從而在理論上證明了本文演算法的有效性和優越性。
  14. In chapter 3, we give an equivalent form of semi - infinite programming, and a locally convergent ssle method is proposed for sip. we only need solve a linear system equations and a subproblem with a parameter per step, also a modified algorithm which saves cost of computations is given, at the end of the paper, we give a proof of the convergence for the algorithms

    第三章通過適當的變形，得到半無限規劃問題的一個等價形式，並給出一個局部收斂的序列線性方程組演算法，這個演算法在每一步，只需求解一個線性方程組和一個帶參數的非線性子問題，證明了演算法的收斂性，同時，給出了一個修正演算法，與前面演算法相比較，修正演算法節約一定的計算量，同樣具有較好的收斂性。
  15. The reason why we integrate them is that k - means algorithm is a mountain climbing method, which is easy convergent to local extremum, and sensitive to the original condition, but its convergent speed is relatively fast, and that genetic algorithm is a random searching method, which can find the whole extremum in a rather big probability, and non - sensitive to the original condition, but its convergent speed relatively slow

    之所以將：二者結合在一起，是回為k一均值演算法是一種爬山法，容易收斂到岡部極小值，對初始條件較敏感，但收斂速度較快，而遺傳演算法是卞dl隨機搜索演算法，能夠以較大概率找到全局最憂解，且對們始條件個敏感，但收斂速度較慢。
  16. When analyzing network ' s capability, the new method and the method based on conventional bp algorithm are respectively applied to predicting reservoir water saturation in lin pan - shui oil field. the result shows that the former is more improved than the latter in the convergent speed and the error precision

    在進行性能分析時分別用新方法和基於傳統神經網路的方法建立臨盤水油田儲集層含水飽和度預測模型，前者比後者在收斂速度和誤差精度上有較大的提高。
  17. The theory analysis and experimental results show that the algorithm not only effectively keeps population diversity, but also alleviates the undulate phenomenon in evolutionary latter stages meanwhile increases the convergent speed greatly

    理論分析和模擬結果表明，該演算法不僅能夠有效地保持群體多樣性，而且減輕了遺傳演算法的後期波動現象，同時收斂速度明顯提高。
  18. According to antibody - antibody ab - ab affinity and antibody - antigen ab - ag affinity, the algorithm can allot adaptively the scales of memory unit and antibody population. it is proved theoretically that the csaim is convergent with probability 1

    由於遺傳和免疫細胞在增殖中的基因突變，形成了免疫細胞的多樣性，這些細胞的不斷增殖形成無性繁殖系，無性繁殖稱為克隆。
  19. The experiments show ngaaps has prominently better convergent performance than simple genetic algorithm

    實驗數據表明，該演算法具有比簡單遺傳演算法好的收斂性能。
  20. And a convergent algorithm for solving the network capacity model is pointed out

    對人才網路和信息網路的調控也可利用該關系作參考。
分享友人
分享到 Line

分享到臉書