排序演算法 的英文怎麼說

中文拼音 [bèixùyǎnsuànfǎ]
排序演算法 英文
sort algorithm
  • 排 : 排構詞成分。
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 排序 : collate
  1. The natsort ( ) function sorts an array by using a " natural order " algorithm. the values keep their original keys

    函數的作用是用「自然排序」演算法對數組排序。數組內所有值的鍵保持不變。
  2. The paper introduces a sorting algorithm, in the unsorted data sheet, firstly this algorithm counts the element that is smaller or equal to each element by comparison, then determines the location of element in the new sheet according to the above counted nummer directly

    摘要本文介紹了一種在待排序的記錄表中，通過兩兩比較先求出小於每個元素的元素個數，然後根據此個數直接確定該元素在排序后新表中的位置的排序演算法。
  3. The mo - dified first - come - first - served algorithm, time - adva nc e algorithm and constrained position - shift algorithm are put forward to automat ically plan the most efficient landing order, to assign optimal spaced landing times to all arrivals without violate the spacing requirements for different typ es of aircraft and to enhance the usage of the runway under heavy traffic condit ion in the terminal area

    為了能夠在終端區交通繁忙的情況下高效地為到達的飛機流安排合理的著陸次序，並在不違反飛機間距要求的情況下給出各飛機經過優化的著陸時間，提高機場跑道的利用率，提出了經過改進的先來先服務、帶有時間提前量、帶有約束的位置偏移三種排序演算法。
  4. This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem, based on depth - first - search implicit emumeration algorithm, subject to mps limiting, position lock limiting and optimization depth limiting

    摘要以深度優先搜索的隱枚舉演算法為基礎，結合mps約束、位置凍結限制、優化深度限制，使用復雜的軟體編碼實現了特定於飛機著陸調度問題的優化排序演算法。
  5. Also show that this algorithm excels previous iddt atpg algorithm

    除了上面這些理論工作之外，結合實際應用，對排序演算法進行了研究。
  6. This sorting algorithm ignores dashes when sorting

    此排序演算法在排序時忽略破折號。
  7. As well known, sorting algorithm is very important for application, especially data mining recently. this thesis presents a subsection insertion - sorting algorithm with equal probability data segmentation and multi - resource data equal probability statistical subsection insertion - sorting algorithm

    本文提出了數據等概率分檔排序演算法和多數據源數據等概率分檔排序演算法，實驗結果表明，這兩個演算法分別好於同類演算法。
  8. Instruction and research on the two basic order - arranging algorithms in the algorithm ianguage

    演算法語言中的兩個基本排序演算法的教學與研究
  9. A new method to implement bubble sorting algorithm

    實現冒泡排序演算法的一種新方法
  10. In this paper, we also make entail research about the air traffic flow in the terminal area, and then bring forward a new plane queue sequencing algorithm : a passively insert - in style and dynamic sequencing window

    有了上述基礎，本論文再提出一種新的飛機隊列排序演算法，引入了被動插入式動態排序窗的概念，不同於現在國際和國內所使用或正在研究的演算法，本演算法在無空中交通擁擠時遵守「先到先服務」服務規則。
  11. Sorting algorithm can solve logic gate circuit for more fanout, more loop nestification and feedback alternately. we sort these nodes according to their joint relationship by the sort algorithm that can determine the priority order of digital circuit simulation and give the feedback chain

    排序演算法可以解決具有多扇出、多迴路嵌套及交叉反饋的邏輯門電路，按照其連接關系進行排序，並給出其中的最大反饋鏈。
  12. In chapterl, we introduce basic concepts about scheduling, the worst - case ratio analysis of approximation algorithms, stochastic scheduling problem and classes of stochastic scheduling policies

    我們在第一章中首先介紹排序問題的基本概念，排序演算法的性能分析，以及隨機性排序問題及其排序策略。
  13. In order to solve the problem that current search engines provide query - oriented searches rather than user - oriented ones, and that this improper orientation leads to the search engines ' inability to meet the personalized requirements of users, a novel method based on probabilistic latent semantic analysis ( plsa ) is proposed to convert query - oriented web search to user - oriented web search. first, a user profile represented as a user ' s topics of interest vector is created by analyzing the user ' s click through data based on plsa, then the user ' s queries are mapped into categories based on the user ' s preferences, and finally the result list is re - ranked according to the user ' s interests based on the new proposed method named user - oriented pagerank ( uopr ). experiments on real life datasets show that the user - oriented search system that adopts plsa takes considerable consideration of user preferences and better satisfies a user ' s personalized information needs

    針對當前的搜索引擎提供面向查詢、而非面向用戶的服務，從而導致搜索引擎無法滿足用戶個性化的需求這一問題，提出了一種基於plsa的新方法，將面向查詢詞的搜索轉變成面向用戶的搜索.首先，通過分析用戶查詢歷史和瀏覽記錄建立代表用戶模型的用戶興趣向量，在用戶發出查詢時用戶的查詢詞根據用戶興趣向量被映射到興趣分類上，最終根據面向用戶排序演算法將返回結果列表重新排序.實驗表明該面向用戶搜索系統能夠充分考慮用戶的偏好，從而更好地滿足不同用戶的信息需求
  14. The method and approach to sequencing for research projects based on dea principle

    任意分佈數據的映射歸並排序演算法研究
  15. A new algorithm for the scheduling of parallel machines

    并行加工系統中的一種排序演算法
  16. Semi online scheduling on three identical machines

    三臺平行同型機的一個半在線排序演算法
  17. A parallel odd - even sorting algorithm for simd - sm

    模型上的奇偶排序演算法
  18. Pagerank - pro - an improved page rank algorithm

    一種改進的網頁排序演算法
  19. A group of multi - insertion sort algorithm

    多插入排序演算法族
  20. Simple sorts and their improvements

    簡單排序演算法的改進
分享友人
分享到 Line

分享到臉書