插入排序法 的英文怎麼說

中文拼音 [chābèi]
插入排序法 英文
sort-by-insertion method
  • : 動詞1. (把細長或薄的東西放進、擠入、刺進或穿入; 插上; 插進) stick in; insert 2. (中間加進去; 加進中間去) interpose; insert
  • : Ⅰ動詞1 (進來或進去) enter 2 (參加) join; be admitted into; become a member of 3 (合乎) conf...
  • : 排構詞成分。
  • : Ⅰ名詞1 (由國家制定或認可的行為規則的總稱) law 2 (方法; 方式) way; method; mode; means 3 (標...
  • 插入 : insert; infix; run in; break in; patch; insertion; plug in; intercalate; intercalation; intromiss...
  • 排序 : collate
  1. Chinese journal of semiconductors, 2003, 24 : 1121 - 1129. 12 lepak k m, xu m, chen j, he l. simultaneous shield insertion and net ordering for capacitive and inductive coupling minimization

    He教授在k eff模型下提出了貪婪屏蔽線演算圖著色和啟發式的同時屏蔽和線網sino演算來解決噪聲優化問題。
  2. 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

    有了上述基礎,本論文再提出一種新的飛機隊列演算,引了被動式動態窗的概念,不同於現在國際和國內所使用或正在研究的演算,本演算在無空中交通擁擠時遵守「先到先服務」服務規則。
  3. 16 lin s, chang n, nakagawa o s. quick on - chip self - and mutual - inductance screen. in proc

    同時屏蔽和線網是一種減少耦合電容和耦合電感噪聲的有效方
  4. A group of multi - insertion sort algorithm

    演算
  5. Method of the map to get the map entries in insertion order

    來獲取按列的映射表條目。
  6. Search algorithm, definition of sort, insertion sort, quick sort, optimal sort time, merge sort, heap sort, radix sort, summarize of sort algorithms

    搜索演算定義;;快速;最優時間;歸並;堆;基數總結。
  7. Download the updated driver to fix usb problems on computers with an amd processor running at 350 mhz or faster and via technologies usb controller

    如果下列的硬體元件已經裝置在執行microsoft windows 98第二版的電腦之上,您所的通用列匯流usb設備可能無運作: amd處理器以350 mhz或更快的速率運行, via technologies usb控制器
  8. The definition, the essential, the orietation model and eleven kinds of functions of mes was dissertated in the article, the relation between mes and the plan layer and the control layer was deeply analysised, and the characteristic of mes in the industry application was researched in detail. after analysised the current production condition and the existent problem in jigang plate plant, the design of system frame, dadabase and function module have been studied, and the realization of it has been expounded. for solving the low efficiency in arranging the rolling plan by man, based on the traveling salesman problem and the pack problem about 0, 1, the mathematics model of the schedule of rolling plan was put forward, and the most near insert way was introduced to solve it, the result was satisfied. based on the practical demands of jigang plate plant combined the academic research of mes software, it has been realized the valid combination between the management of production scene and the upper management software in the dissertation

    本文論述了mes的定義及其實質、 mes的定位模型和其十一項功能,深分析它與計劃層和控制層的關系,並闡述了mes在行業應用中的特點。在分析濟鋼中厚板廠生產現狀及其存在的問題后,研究了系統的體系結構設計、數據庫設計和功能模塊設計,並對其實現進行了闡述。為了解決人工經驗編軋製作業計劃問題的低效性,提出了基於旅行商問題和0 1背包問題的軋製作業計劃數學模型,並採用最近進行求解,取得了滿意的效果。
  9. Agv ( automated guided vehicle ) optimization is a typical np problem, in the course of initial group generation, this article applied accumulator process, crossover operator based continuous insertion heuristic mode, and push - connect - exclude method. according to stacker running process and characteristics, stacker optimization was devided into two parts, the first one was shelves number optimization, the second one was travel scheduling problem. finally, this article written genetic algorithm program based on c

    Agv的優化調度屬于典型的np問題,在初始群體的產生中,採用聚加過程,並建立了可行的條件;提出了基於連續啟發式的交叉運算元;採用了推?銜接?除過程來使任務的滿意度達到最佳;針對堆垛機的運行過程,建立了數學模型,並依據其運行特點,把堆垛機的優化分為兩部分,一是針對庫位號的優化,改變傳統的庫位號列方式,利用遺傳演算建立起比較合理的庫位號列順;二是把堆垛機的運行線路簡化為旅行商問題,並做了適當的修改。
  10. Super set of iemset x ) according to constrained subtree of itemset x, if item “ a ” isn ’ t a fuzzy item, we don ’ t scan database in addition. it can be generated by ffp tree. we propose two order methods for constructing ffp tree. one is that sorting database attributes holding frequent item in ascending order of their nodes number in ffp tree. another is that sorting frequent item of not fuzzy attributes in descending order of their support firstly, then sorting database fuzzy attributes with frequent item in ascending order of their nodes number in ffp tree. our experimental results show that although fmf needs more space costly than the algorithms based on apriori, its time costly is obviously lower than the latter

    針對ffp -樹的生成,提出了兩種:按屬性順將每個屬性下的頻繁項目依次到頭表中,屬性按照其在ffp -樹中可能的不同結點的個數從少到多進行;先對非模糊屬性下的頻繁項目按支持度從大到小進行,再對模糊屬性按其在ffp -樹中包含的不同結點的個數,從少到多進行,然後依次將各屬性下的頻繁項目到頭表中。
  11. Insertion sort simplified - approximately ten kinds of sorting methods are available, namely heap, quick, merge, insertion, shell, selection, bubble, linear, address selection, and radix sort

    大約有10種,如堆、快速、歸並、外殼、選擇、早泡、線性、地址選擇和基。我自己提出了一種簡化的快速
  12. You show dependencies by ordering the inserted projects logically ( for example, phase 1 before phase 2, and so on ), placing them at the correct outline level ( for example, subphase a under phase 1 ), and linking individual tasks between projects to show scheduling dependencies ( for example, task 9 in phase 1 must finish before task 6 in phase 3 can begin )

    顯示相關性的方是:將的項目合乎邏輯地(譬如階段1在階段2之前等等) 、將它們置於正確的大綱級別(譬如子階段a在階段1之下)以及鏈接項目間的各個任務以顯示日程的相關性(譬如,階段1中的任務9必須在階段3中的任務6開始之前完成) 。
分享友人