algorithm of euclid 中文意思是什麼
algorithm of euclid
解釋
歐幾里得演算法-
The core of euclid s algorithm is moved from the. c file to an. asm file, with the. c file calling into the. asm file
歐幾里得演算法的核心從. c文件移到. asm文件，並且 -
In this sample, the core of euclid s algorithm is moved from the. c file to an. asm file, with the. c file calling into the. asm file
在此示例中，歐幾里得演算法的核心從. c文件移到. asm文件，並且 -
On the background of selecting an optimal combination of elastic pads " height between the two adjacent cylinders, which carry out the design requirement of combinative cylinders assembled structure, in this dissertation, the optimal design model is established ground on geometrical and mechanical model of the combinative cylinders assembled structure. the algorithm that integrates multi - objective ' s decision - making method with minimal distance between two points in euclid ' s space into the modified genetic algorithm to solute the optimal model is presented
本文以選取層間彈性墊層厚度實現組合圓筒裱糊裝配結構的設計要求為研究背景，依據組合圓筒裱糊裝配結構的幾何模型與力學模型，建立組合圓筒裱糊裝配結構的優化模型，提出改進遺傳演算法與歐幾里德空間最短距離準則的多目標決策方法相結合的優化演算法。 -
Based on the genetic algorithm ' s global searching capability with probability regulation and euclid ' s space distance metric to settle multi - objective, the algorithm that integrates multi - objective ' s decision - making into the modified genetic algorithm to solute the optimal model with discrete variables and multi - objective is proposed. during the algorithm ' s design, the euclid ' s space distance metric is proposed to transform the multi - objective problem into single objective problem. and some modified measure to fitness function and crossover probability and mutation probability are used to improve the performance of the algorithm and avoid premature convergence
演算法設計過程中，利用歐幾里德空間距離準則和罰函數法，將含有約束條件的多目標規劃問題轉化為無約束的單目標優化問題；針對簡單遺傳演算法出現的早熟，構造隨進化代數動態調整適應度的適應度函數和隨個體適應度自適應調整的交叉、變異概率；提出比例選擇與精英保留策略相結合的選擇、兩點交叉和簡單變異的改進遺傳演算法。 -
In the key generation algorithm, a best method of generating key is found through theory analysis and many experiments. in the multiplicative inverse of modulo, a new algorithm is initiated which needs less memory and runs faster than extended euclid
對于求模逆元演算法，在擴展歐拉演算法的基礎上，提出了一種新的求模逆元演算法，該演算法比擴展歐拉演算法不僅內存所需更少，而且運行速度更快。 -
In section one, based on theory of n dimensional euclid space, a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem. this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space, the feasible region of any linear programming problem is a extended convex polyhedron, of which surface is consisted of some planes, and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter
第一部分內容是在n維歐氏空間理論的基礎上提出了一種求解線性規劃問題的新演算法? 「點線面」循環尋優法，本演算法是基於如下思想提出來的：我們知道，在三維歐氏空間中，線性規劃問題的可行域是一個由若干個平面圍成的廣義多面體，目標函數可以看作是以目標函數值為參變量的一個平行平面束。
分享友人