search direction 中文意思是什麼
search direction
解釋
查找方向-
By reformulating the kkt system as a constrained equation, the algorithm generates the search direction by solving a linear equation at each iteration
通過將問題的kkt系統轉化成一個約束方程，演算法在每步迭代只需解一個線性方程組即可得到搜索方向。 -
Changes the search direction only
只更改搜索方向。 -
Returns the position of the first editable position after the specified position using the specified search direction
使用指定的搜索方向，返回指定位置之後第一個可編輯位置的位置。 -
Returns the position of the first editable position between the specified positions using the specified search direction
使用指定的搜索方向，返回指定位置之間第一個可編輯位置的位置。 -
Returns the position of the first non - editable position after the specified position using the specified search direction
使用指定的搜索方向，返回指定位置之後第一個不可編輯位置的位置。 -
Returns the position of the first non - editable position between the specified positions using the specified search direction
使用指定的搜索方向，返回指定位置之間第一個不可編輯位置的位置。 -
It has been deduced that the search direction remains the same but that the step length decreases in optimizing the improved cost function with the conjugate gradient algorithm from the gradient of the cost function that the fir filter apporaches the contrary point spread function ( psf ) more, and that the estimated image is closer to the original one
從代價函數的梯度入手推導出共軛梯度演算法，其搜索方向保持不變而搜索步長變小，使濾波系數更加退近於點擴展函數逆運算元，從而使估計圖像與原始圖像更加接近。 -
Fix the volatile search direction bug
修改了查找方向不穩定的問題。 -
By adopting texture statistics for ray - space slice, initial search direction was established, and then multi - layer rectilinear direction search method was realized in inter - slice prediction
在片間預測中，通過對光線空間片的紋理統計，確立初始的搜索方向，實現分層的直線方向搜索方法。 -
This algorithm allows the search direction with only moderate accuracy, and does not require the feasibility of the iteration points
該演算法允許搜索方向有相對較大的誤差，且不要求迭代點的可行性。 -
The mineral resource potentialities and ore - search direction of w - mo deposits in kunshan - daheli of north jiangxi
大河裡地區鎢鉬礦資源潛力及找礦方向 -
Returns the position of the first unassigned editable position after the specified position using the specified search direction
使用指定的搜索方向，返回指定位置之後第一個未賦值可編輯位置的位置。 -
Returns the position of the first unassigned editable position between the specified positions using the specified search direction
使用指定的搜索方向，返回指定位置之間第一個未賦值可編輯位置的位置。 -
In chapter 3, by minimizing a quadratic model restricting next search direction to a subset of span { - g _ ( k ), d _ ( k - 1 ) }, we propose other formula of parameter ~ ( * ) k convergences of the new method and its hybrid formula are proved under monotone line search. their numerical results show that they are efficient
在第三章中，通過最小化一個限制下次搜索方向在span { - g _ k ， d _ （ k - 1 ） }子集上的二次模型，我們提出了_ k ~ *取新形式或其雜交形式的共軛梯度法是有效的。 -
The best search direction was decided by the new swarm which was built by the best individual of each chromosome
通過搜索各種群中各染色體的最優個體，組成一個新的種群，並以此種群作為當前最優種群來確定量子門的全局最優搜索方向。 -
In the course of the evolution of algorithm, the number of niche peaks is decided by seed identification and preservation process, the fitness ascending direction is applied to control search direction, adaptive population distance is used to control search range
演算法的進化過程中，通過物種的辨識和保存過程確定小生境的峰值，引入個體趨向于高適應度的方向這一控制參數控制搜索的方向，採用自適應調整種群距離的方法控制搜索的范圍，大大提高了搜索效率。 -
Genetic algorithm is a global algorithm which uses natural law " survival of the fittest, extinction of the unfitness " and natural selection mechanism to guide and determinate search direction
遺傳演算法是全局優化的搜索演算法，它利用優勝劣汰的自然選擇來指導和學習以確定搜索方向。 -
Genetic algorithm ( ga ) is a global algorithm which uses natural law " survival of the fittest, extinction of the unfitness " and natural selection and heredity mechanism to guide and determinate search direction
因此，本文在前人的基礎上，探討了基於rbf神經網路的ect圖像重建方法。遺傳演算法是一類借鑒生物界優勝劣汰的自然選擇和自然遺傳機制的全局優化演算法。 -
At present, constrained optimization methods may be classified to two classes, one is search method which firstly asserts whether the current point is an optimal point, if the point is not, then we must choose search directions, and along the search direction, find the next iterative point which make the objective function or merit function to decrease
目前的約束優化演算法可以分成兩大類，一類是搜索演算法，這種演算法首先判斷當前點是否為最優點，若非最優點則要確定搜索方向，然後沿此方向確定一個使目標函數或評價函數下降的點。這種演算法一般為下降演算法，如可行方向法、約束變尺度法等。 -
First, we develop the local search such that the search direction, search radius and numbei of search points are adjusted according to the previous search result
首先改進了局部搜索演算法，使得搜索方向，搜索半徑和搜索所計算的函數值個數根據已有的搜索結果而自適應調整。
分享友人