bisection algorithm 中文意思是什麼
bisection algorithm
解釋
分半演算法-
In traditional atm networks, the most widely used dynamic bandwidth allocation algorithm is known as “ bisection algorithm ”
在傳統的atm網路中，使用最為廣泛的動態分配帶寬的最優演算法是二分法。 -
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
數值實驗與理論分析均表明該演算法適用於求解大規模問題，且具有良好的收斂性；其次，研究了電路二等分問題。 -
The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2
數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異 -
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迭代法，理論和數值實驗表明改進的演算法的收斂性比經典演算法好 -
By studying the solution to generalized effective medium satori resistivity model in laminated and dispersed shaly sand, it shows that there is a local minimum of the function about w derived from the model in the range from 0 to, and the w corresponding to the minimum varies with or w as well as other parameters, therefore, in order to ensure the iteration convergence, here, we adopt a hybrid algorithm combining newton and bisection, and the calculated result shows that using the hybrid algorithm to solve the equation about w is convergent. it is pointed out that shale distribution largely affects water saturatio n predicted by this model
通過研究混合泥質砂巖有效介質通用satori電阻率模型的求解方法，表明模型導出的關于_ w函數在0 -區間內存在一個局部極小值，且該極小值點對應的_ w隨或_ w及其他參數的變化而變化，因此，為了保證迭代收斂，採用牛頓和二分結合的混合迭代演算法，試算結果表明利用牛頓和二分混合迭代演算法求解關于_ w的方程是收斂。 -
There are many faults in the chaotic optimization algorithm. to solve these problems, a new method named " bisection - interpolation approach " is put forward. it has numerous advantages such as ergodicity, uniform distribution, not sensitive to the change of initial value, not sensitive to the defining range of variable, not requiring the continuation and not requiring differential of the optimized object
該演算法和混飩一樣具有遍歷性的特點，且變量均勻分佈於定義域，對函數的定義域變化和初值的選定都不敏感，同樣也不需要函數連續、可微，對優化對象幾乎沒有特別要求，從而避兔混池優化演算法的缺點。 -
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 .給出圖的最大二等分問題的整數規劃模型的等價模型及其新的半定規劃鬆弛模型，利用投影梯度演算法求解該半定規劃鬆弛模型，然後利用隨機擾動演算法求得原問題的次優解 -
In the simulation of functions, this method performs better than chaotic optimization algorithm. with the combination of bisection - interpolation approach and gauss newton levenberg - marquardt method, we optimize neural network and fuzzy inference system. taking advantage of bisection - interpolation approach, simulated annealing algorithm and genetic algorithm find the better solution than chaotic combination method
作者通過大量的函數模擬以及將其與牛頓高斯levenberg一manquardt方法、模擬退火、遺傳演算法等常用演算法相結合，形成的混合優化演算法，對神經網路、模糊神經網路和函數進行了優化，其優化效果明顯優于混飩以及混飩混合優化演算法。
分享友人