path convergence 中文意思是什麼

path convergence 解釋
路徑趨同
  • path : path（ol ）＝pathological; pathology n （pl paths ）1 （自然踏成的）路；路徑；（馬路邊上的）人行...
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. The convergence feature and development path of didactic structure in central jiangsu

    蘇中二元結構趨同特徵和發展路徑
  2. Because ga possesses the traits of can global random search, the robustness is strong, been use briefly and broadly, it didn ’ t use path search, and use probability search, didn ’ t care inherence rule of problem itself, can search the global optimum points effectively and rapidly in great vector space of complicated, many peak values, cannot differentiable. so it can offset the shortages of nn study algorithm, can reduce the possibility that the minimum value get into local greatly, the speed of convergence can improve, interpolation time shorten greatly, the quantity of training reduce

    因為遺傳演算法具有全局隨機搜索能力，魯棒性強、使用簡單和廣泛的特點，它不採用路徑搜索，而採用概率搜索，不用關心問題本身的內在規律，能夠在復雜的、多峰值的、不可微的大矢量空間中迅速有效地尋找到全局最優解，所以可以彌補神經網路學習演算法的不足，使陷入局部最小值的可能性大大減少，使得收斂速度提高，訓練量減小。
  3. 3 a novel recursive least - square ( rls ) blind space - time receiver algorithm based on the constrained condition, which can completely avoid the matrix inversion introduced into by constraints ( comparing with the normal rls ), is proposed for multi - path slow fading cdma channels. the computational complexity of this method is not only lower than that of the normal rls, but also lower than that of both lms and ls blind space - time receiver methods that are realized based on the rosen ' s gradient projection. and the speed of convergence of the presented rls blind space - time receiver algorithm is better than that of both lms and ls blind space - time receiver methods

    3 、針對多徑慢衰落通道下ds - cdma盲空時接收機中線性約束二次規劃問題提出一種新的遞歸最小二乘演算法，該演算法完全避免因約束而引進的矩陣求逆運算（相對于常規的遞歸最小二乘演算法） ，不但運算量比常規的要低，而且比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時接收機演算法還低，且收斂速度比基於rosen梯度投影實現的最小均方（ lms ）與最小二乘盲空時多用戶檢測都好，將提出的新的遞歸最小二乘演算法與提出的數據選擇方案結合起來可以進一步降低其運算量，具有很大的實用價值，最後通過模擬實驗進一步分析了其性能。
  4. Then this paper discusses the following three research emphasis : 1. in parts, diversity - guided evolutionary algorithms which is applied in the path planning of robots avoids the prematurely convergence

    然後討論了本文以下三個方面的研究重點： 1 、在移動機器人全局路徑規劃中採用多樣性指導進化演算法，它在一定程度上解決了早熟現象。
  5. By giving some properties of the double dogleg path, we prove the global convergence and fast local convergence rate of the proposed algorithm under some reasonable conditions

    通過給出雙折線路徑的一些性質，在合理的條件下，我們證明了所提供演算法具有整體收斂性並得到局部收斂速率。
分享友人
分享到 Line

分享到臉書