algorithm complexity 中文意思是什麼
algorithm complexity
解釋
演算法復雜性- algorithm : n. 【數學】演算法；規則系統；演段。
- complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
-
Because of no limitation to task granularity, ppa is especially suitable for scheduling fine granularity tasks ( also suitable for coarse and medium tasks of course ), consequently helpful theoretically and practically for studying task schedule algorithm for rtdcs. according to the principle of fault - tolerant scheduling, combined with characteristics of tft in rtdcs, the paper puts forward the scheduling model of tft, corresponding implementation mechanism and the dynamic fault - tolerant scheduling algorithm ( namely ftpb ) and analyzes its complexity, with experimental data and contrast table compared with other analogic algorithm
結合實時分佈系統中容錯任務的特點，根據容錯調度原理，給出了容錯任務的調度模型、實現機制及動態容錯調度演算法ftpb ，並對演算法進行了復雜哈爾濱工程大學博士學位論文; ; ; ; ;二; ; ; ;奮石石奮; ;性分析，給出了演算法實驗數據及與其它同類演算法的比較結果。 -
In order to improve the existing methodology of carpool information retrieval, on the basis of the region to region algorithm and by the use of the graph theory, an algorithm based on traffic network and its complexity analysis were presented
低效率的信息交流方式制約了合乘出行方式的發展，針對現有合乘信息檢索方式的不足，在區域區域匹配演算法的基礎上，引入圖的概念，提出了一個基於交通路網的路徑匹配演算法，並給出了演算法復雜度分析。 -
According to the low speed of constringency and high complexity of training methods in large scale training, particle swarm algorithm is brought forward to solve the problem
針對在大規模訓練中演算法收斂速度慢、復雜程度高等問題，提出用粒子群演算法求解其中的二次規劃問題的思想。 -
First this paper describes the composing and technics of drillers ; then the composing of control system based on s7 - 300plc is described ; then thinking of such characteristics of oil driller as complexity and long delay, this paper brings forward the control strategy of combining the fuzzy control with smith estimate control algorithm, and sets down the way of auto - driller based on discal hydraulic pressure brake. at last the experiment based on matlab by computer shows that the effect of this control mode is very good and all performance are famous
首先本文闡述了鉆機的組成與工藝特點，然後描述了基於西門子s7 - 300plc的控制系統組成，然後針對傳統鉆機自動送鉆控制策略落後的缺陷，同時考慮到鉆機的復雜性、大滯后等特點，提出了模糊控制演算法與施密斯（ smith ）預估控制演算法相結合的控制策略，給出了基於液壓盤式剎車的自動送鉆智能控制策略， matlab的模擬實驗證明該控制方式控制效果良好，各方面性能指標都達到理想要求。 -
At last this module is synthesized using 6s06dpdm technology library. 3, the algorithm used in key module to the performance of data security is thoroughly analyzed. considering both performance of enciphering and degree of complexity of realization, steam cipher algorithm is used
3 、對數據通信安全性起決定作用的加密模塊所採用的加密演算法進行了深入的分析，綜合加密性能和實現的復雜度的考慮，採用了流密碼的加密演算法。 -
The simulation results show that the proposed algorithm can accomplish the multilevel group formation in real time with lower calculation complexity, and better performance can be achieved in the situation assessment for space group formation
模擬結果表明，所提演算法能實時完成多個級別的空間合群融合，其計算復雜度也比較低，而且在空間合群的態勢評估中獲得了比較好的結果。 -
Again, if the analysis engine knows if loading coils are allowed, and, if so, how they may be present, algorithm complexity can be eased
再次地，如果分析引擎知道是否允許負載線圈，如果有的話，他們是如何安裝的，即能降低演算法復雜性。 -
It ' s never about the volume of analyzed data or the complexity of an algorithm, but about the actionability of derived insights
（優秀數據分析）不在於掌握了多大量的數據，也不在於多復雜的演算法，而在於得出可以行動的洞察。 -
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 ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。 -
Moreover, this theory can change the problem in non - linearity space to that in the linearity space in order to reduce the algorithm complexity by using the kernel function idea
又由於採用了核函數思想，使它把非線性空間的問題轉換到線性空間，降低了演算法的復雜度。 -
An alternate proof about its existence and uniqueness and its explicit represention are given, especially the rational interpolation formulas for simple konts and double konts, and the algorithm complexity in case of double konts is improved from o ( n ~ 2 ) to o ( n )
首先，介紹了cv （ cauchy - vandermonde ）有理函數插值公式，給出了cv有理函數空間上插值問題解的存在唯一性定理的另一種簡單證明和顯式表示 -
In this article, the auther evaluated the mimimal path sets between two nodes with the conection matrix determinant, not the tranditional matrix square function, which greatly reduced the algorithm complexity
本文用聯絡矩陣的行列式運算代替傳統的矩陣乘方運算來求網路兩點之間正常的狀態集合，進而求出網路系統的可靠度，極大的減少了運算的復雜性。 -
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熵表徵起始流化態至鼓泡態之間變化時所得到的結果相一致，並能明確地指示固定床、鼓泡流化及湍動流化等不同流態之間的轉變過程，為流型識別提供了新思路。 -
Because of the characteristic of fft, a new recursion method is designed in the paper. and then the algorithm complexity is analyzed
最後，在圖像的編碼方面，本文選用了常見的哈夫曼編碼方法進行并行演算法的設計。 -
The major challenges of real - time implementation with digital signal processing techniques lie in the algorithm complexity and high data rate of radar
由於演算法本身的復雜度和雷達數據的高速率，方位向處理的實時實現具有很大的挑戰性。 -
Model scale and algorithm complexity are also discussed in details. in order to decrease the scale and difficulty, a series of heuristic rules are adopted during solution
文中同時對模型的規模和演算法的復雜性進行了詳細的分析，為了降低問題求解的規模和難度，提出了一系列啟發式規則。 -
For the case of all jobs with constant processing time, corresponding to the case when there are only a constant number of job release times and the general released case, we provide two optimal algorithms and analysis their algorithm complexity
對于所有工件的加工時間都相等的情況，分別對常數個到達時間和任意個到達時間的情況給出了兩個最優演算法，並給出了其演算法復雜性。 -
Moreover, this theory can change the problem in non - linearity space to that in the linearity space in order to reduce the algorithm complexity by using the kernel function idea. svm have become the hotspot of machine learning because of their excellent learning performance
由於採用了結構風險最小化原則代替經驗風險最小化原則，使得較好的解決了小樣本學習的問題；又由於採用了核函數思想，使它把非線性空間的問題轉換到線性空間，降低了演算法的復雜度。 -
This dissertation discusses and studies to surround the knowledge representation, learning, reasoning, and the main contents include : at the first chapter, some familiar uncertain knowledge representation and reasoning and the difficulties of them : evidential theory, certainty factor, fuzzy logic and fuzzy reasoning, subjective bayesian method, belief network are introduced. we present the basic knowledge, primary reasoning algorithm, complexity of reasoning algorithm, the way of dealing with some problem of causality diagram relative and the research direction in causality diagram theory particular at the second chapter
論文圍繞著因果圖的知識表達、學習、推理進行了討論和研究，主要內容包括:在扼要介紹了一些比較常見的不確定性知識的表示和推理方法:證據理論、確定性因子、模糊邏輯與模糊推理、主觀bayes方法、信度網的基本知識之後，比較詳細地闡述了因果圖的知識表達，主要的推理演算法、計算復雜度以及對一些問題的處理方式方法。
分享友人