algorithm complexity中文什么意思

發音:

用"algorithm complexity"造句

算法復雜性

algorithm: n. 【數學】算法；規則系統；演段。
complexity: n. 1.復雜性，復合狀態。 2.復合物；復雜的事物[情 ...
exponential complexity algorithm: 指數復雜性算法
polynomial complexity algorithm: 多項式復雜性算法
complexity: n. 1.復雜性，復合狀態。 2.復合物；復雜的事物[情況]。

下載手機詞典可隨時隨地查詞查翻譯

例句與用法

更多例句：上一頁

( 2 ) with the basis of ( 1 ) , the thesis present a improved hough transform algorithm based on grc , it turns out its improvement on algorithm complexity 、 accuracy and its useness . ( 3 ) with the deeply analysis on the problem existed in a license plate locating algorithm , which based on the extraction of parallelogram , and
( 3 )在車牌定位算法中,在實驗的基礎上深入分析了基于平行四邊形提取的車牌定位算法中存在的問題,并探討了如何用粒度計算解決這些問題。
The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper . the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough , as to continuous attributes , the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited
通過對串行和并行算法時間復雜度的計算表明，當數據集充分大時，由于連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似于處理機個數的加速比，對于離散屬性，本并行算法對串行算法的性能提高有限
Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results
針對job - shop調度問題求最優解算法這一npc問題，本文以充分發揮多產品、多設備加工所具有并發性、異步性、分布性和并行性的加工優勢，從而提高產品的加工效率為目標，對job - shop調度問題的工藝圖進行適當分解，使工序在一定時間段或是為具有唯一緊前、緊后相關工序或是為獨立工序，即將工序分兩類，再結合操作系統中內存調度的最佳適應( bf )調度方法和首次適應( ff )調度方法的先進思想，通過分析提出了一種解決一般job - shop調度問題的全新近優解方案：在考慮關鍵設備上工序盡量緊湊的前提下，將工序分類、對這兩類工序分批采用擬關鍵路徑法( acpm )和最佳適應調度方法( bfsm )安排工序的算法，用實例加以驗證，并給出結果甘特圖。
Complexity parameter c2 , fluctuation complexity parameter cf and algorithm complexity parameter c ( n ) have been adopted to analysis pressure fluctuation signals from a gas - solid fluidized bed , the variation of the three complexity parameters with gas velocity from fixed bed , bubbling fluidization to turbulence fluidization are studied , then compared in order to characterize regime behaviors . it is demonstrated that there exists a phenomenon named " recorded " in the regime transition from fixed bed to bubbling fluidization , the three complex parameters are believed to be a new technique for flow regime identification
結果表明，起始流化至鼓泡態轉變的過程中，復雜性參數表明氣固體系會進行一種所謂的“重構”現象，這與用k熵表征起始流化態至鼓泡態之間變化時所得到的結果相一致，并能明確地指示固定床、鼓泡流化及湍動流化等不同流態之間的轉變過程，為流型識別提供了新思路。