optimal sorting 中文意思是什麼
-
The basic thought is to divide the cities which are close to each other into a group ( physical area ) by applying sorting neural network, find out the optimal path by the improved hnn, and then calculate the local optimal path by using the same method, and finally get the whole optimal path, which are described as following : a assembly s of cities is grouped into some subsets according to their physical location and we can get, and then get the optimal, path of tsp of s = { s, i = 1, 2, n } through the given method, as well as the st
基本思想是利用聚類神經網路先把地理位置上相互靠近的城市劃分為一個集體單位（一個物理區域） ，用改進的hopfield神經網路演算法求解各個區域間的最優（或近似最優）路徑，然後再在每一個區域內部用同樣的方法來求解其局部的最優（或近似最優）路徑，這樣可以最終得到全局的最優（或近似最優）解。描述如下：設有城市集合s ，按城市的地理位置把s劃分為若干子摘要2集，得s ijs ， ，其中廠s ； d ， i一口求得集合i叫s s ； i習， 2 ， … n的tsp最優路徑，再依次求得子集s ；內部的tsp最優路徑，即得最終優化路徑m一） s一） …一寧s ； di -
According to the fuzzy sorting algorithm for multi - target attack, the threatening index matrix with multi - aircraft against multi - target is gained. then, using the principle of saddle point algorithm and the method of relative superior algorithm, the targets are assigned to aircrafts in order that a side of multi - aircraft may get optimal strategy
根據前面研究所得目標機對載機綜合威脅指數的確定方法，可確定目標對載機的威脅指數矩陣，用鞍點演算法結合相對優勢演算法，把目標分配給相應的載機，目的是取得戰術配置優勢。 -
We then do a performance investigation, comparing cache - oblivious algorithms with traditional ram - model algorithms. in the last, on the basis of thorough research, we present an optimal sub - linear working space cache - oblivious sorting algorithm. we conclude that cache - oblivious algorithms do outperform traditional ram - model algorithms when working on large data sets
接著通過性能測試，把高速緩存參數無關演算法與傳統的基於ram模型的演算法做了比較，最後，在深入研究的基礎上提出了一個最優的子線性工作空間的高速緩存參數無關的排序演算法。 -
In consequence, we acquires a set of optimal project through setting up the guideline system of logistics address selection planning project and applying illegibility theory to intangibly quantify each guideline, and through synthetically analyzing and sorting filtered projects ; the designation of configuration and transportation network discuss configuration and transportation route address selection and the arithmetic of vehicle sort, puts forward simple applied arithmetic to transportation route selection, in reference to some practical data
客戶服務主要論述了客戶服務理論及如何確定合理的客戶服務的方法和模型；物流設施的選址包括確定設施的數量、設施的位置和規模，提出了一整套選址模型；配送運輸網路的設計則闡述了配送運輸路線的選址和車次的排序的計算方法，對于運輸路線的選擇和車次安排提出簡單、實用的演算法，並引用了一些實際的數據進行了實證研究。 -
Referring to the theory of the modern air - combat, the thesis discusses the process of beyond visual range air combat about “ air - to - surface precise attack ” ; according to the optimal strategy, studies respectively the four key techniques, which are multi - target sorting, multi - aircraft cooperative air - combat and the optimization of proportional navigation of the fighter and the technique of the associated attack and defend of group fighters
借鑒現代空戰理論，對「空對面精確打擊」中的超視距作戰過程進行了系統論述，對超視距空戰中的四個關鍵技術多目標排序、多機協同空戰，機群聯合攻防及戰機導引律的優化分別進行了研究。 -
Based on triangular membership functions, this paper studies the relationship between the overlapping degree, the selected feature subsets and the veracity of using these feature subsets in sorting the different similarity measures on optimal feature subset selection based on fuzzy value, and finds a more adaptable similarity measure for the optimal feature subset selection method based on fuzzy value
在三角形隸屬度函數的基礎上，研究了基於模糊值的最優特徵子集選取演算法的不同相似性度量公式得出的類間交疊度、選取的特徵子集以及該特徵子集用於分類的準確性之間的關系，找到了比較適合於基於模糊值的最優特徵子集選取演算法的相似性度量公式。
分享友人