時間復雜度 的英文怎麼說

中文拼音 [shíjiānfùzádù]
時間復雜度 英文
computational complexity theory
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 復 : Ⅰ形容詞1 （重復） repeated; double; duplicate 2 （繁復） complex; compound Ⅱ動詞1 （轉過去或轉過...
  • 雜 : Ⅰ形容詞（多種多樣的; 混雜的） miscellaneous; varied; sundry; mixed Ⅱ動詞（混合在一起; 攙雜） mix; blend; mingle
  • 度 : 度動詞[書面語] （推測; 估計） surmise; estimate
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  2. During the research, we also studied the quantum algorithms. we found that there are some problems in grover ' s quantum search algorithm, and proposed an improved quantum search algorithm to resol

    在經典二分法的基礎上，提出了二分法量子搜索演算法，它的時間復雜度為o （ （ lo咖「勺。
  3. In this paper, the problem of calculating movement of piece is simplified to the problem of finding track line segments between vertices and edges, hence the time complexity is much reduced, and special cases such as inner cavity and inner nfp ( no fit polygon ) can also be tackled

    摘要將多邊形滑動碰撞問題轉化為頂點和邊之間的軌跡線提取問題，從而降低了時間復雜度，並可統一處理邊界空腔和內部靠接臨界多邊形問題。
  4. By the study of several typic methods of determining convexo - concave features for vertices of polygon, the computation time complexity of these methods was analysed, and those methods were implemented in vc + +

    摘要主要針對幾種典型的多邊形頂點凸凹性識別演算法進行研究，對它們的計算時間復雜度進行分析，並用vc + + 6 . 0實現多邊形頂點凸凹性的高效識別。
  5. Paper gives out an algorithm for seeking the set of intersection intervals. by it, the i - collede algor ithm is reduced to o ( nlogn )

    其中，提出了一種求相交線段集的演算法，把原i ? collde演算法時間復雜度降為o （ nlogn ） 。
  6. 2. presenting banyan network ' s propert, conflict and the neccesary and sufficent condions of conflict. then, three routing algorithms are presented on realizing permutation routing based on time domain approach under the constraint of avoiding crosstalk, and the complexity of the algotithms are analysed

    2 、給出了banyan網路的一些性質及實現置換路由的沖突次數及發生沖突的充要條件，並且給出了基於時域法的無串擾的實現置換路由的三種調度演算法，討論了演算法的時間復雜度以及所需要的調度次數的上界。
  7. 1 milgram s. the small world problem. psychology today, 1967, 61 : 60 - 67. 2 albert r, jeong h, barabasi a l. the diameter of the world wide web

    據本文作者所知，目前最好的基於small world網路的路由演算法只能達到o lg n 1 1 d的時間復雜度。
  8. 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

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  9. Time complexity analysis of two non - angle algorithms to determine the radial spatial adjacent relationship

    確定射線空間相鄰關系的兩個非角度演算法的時間復雜度分析
  10. In the study on level wise search algorithm, the structure and character of three basic frequent set discovery algorithms ais, apriori and dhp are studied by simulation. a model of level wise search algorithm is given and its time complexity is analyzed respectively on transaction scale, item length and support parameter

    在分層搜索演算法的研究方面，本文模擬分析了ais 、 apriori和dhp三種基本演算法的結構和特點，構造了一個分層搜索演算法的時間復雜度模型，從事務規模、數據項平均長度和支持度三個方面，對分層搜索演算法的時間復雜性進行了分析和驗證。
  11. Next, introduct the technology of the protocol analysis. it means when examin the data packet, wo can use the protocol analysis technology to distinguish the protocol type of the data, then use the corresponding data analysis procedure to examin the data packet. so the examination efficiency can improved. finally, the k - r algorithm used for system data analysis module is parallelized design. and through the comparision the original algorithm and parallel algorithm, we can find that under the

    即在對截獲的數據包進行檢測時，先使用協議分析的技術辨別數據包的協議類型，再使用相應的數據分析程序來檢測數據包，從而提高了系統的檢測效率; 5 ）對系統數據分析模塊中使用的k - r模式匹配演算法進行了并行化設計，並比較了原演算法和并行演算法的時間復雜度和執行代價。
  12. For boosting the efficiency of web ir and reinforcing the interaction between system and user, this thesis improves the completeness and time complexity under some situation of the lingo algorithm, which is used for web page on - line clustering

    為提高web信息檢索的效率，加強系統與用戶的動態交互，本文改進了一種適合網頁在線聚類的lingo演算法，加強了演算法的完備性，降低了部分情況下的時間復雜度。
  13. The information of skeleton is also used to deal with branching problem. experiments show that the proposed algorithm can retrieve cases with complex contours. the technique of surface reconstruction using distance field is explored in chapter 4

    對于離散距離場的計算，我們提出用輪廓線擴散的方法來進行加速，和最小歐幾里得距離方法比較，該方法具有速度快的優點，其時間復雜度為o加。
  14. This article, according to the common digital keyboard on the mobile communication equipment, make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard. using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information. chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space

    本文就根據移動通信設備上常見的數字鍵盤，為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究；並使用了一種在查找時空間復雜度為o （ n ） 、時間復雜度為o （ n ）的樹形結構來存儲中文信息，使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、佔用空間少的優點。
  15. Different from previous document clustering method based on nmf, our methods try to discover both the geometric and discriminating structures of the document space in an unsupervised manner, companied with high accuracy in acceptable computationally expensive

    與基於nmf演算法的文本聚類不同，我們的演算法力求以無監督的方式，在時間復雜度允許的范圍內，找到更適合於分類操作的數據向量間的幾何局部特徵向量及相應的各文檔的編碼向量。
  16. Although paff can enhance the coding performance, whereas, the time complexity ascends more than twice. in order to reduce time consumption, one - pass fast paff based on motion diction is proposed in this paper

    雖然採用paff技術使得編碼性能有所提高，但會導致時間復雜度上升2倍以上，為了降低時間損耗，本文提出了基於運動檢測的one - pass快速幀場自適應演算法。
  17. The traditional methods on extracting content are representing the web page with the data structure of trees in the main memory. unfortunately, the space and time complexity is relatively high when building and searching the tree

    傳統的方法是將網頁結構表示成樹，但建樹與查找樹的過程中，空間與時間復雜度都過高。
  18. Furthermore, combined the execution rule of petri nets and the search algorithms of tree, an innovative scheduling method is proposed by applying a heuristic search to the state space of petri nets. specially, by introducing heuristic function, depth - first and width - first is mixed in the search course ; thereby a feasible solution can be generated in a reasonable amount of time

    其次，在所得柔性製造系統petri網模型的基礎上，通過把樹的遍歷演算法與petri網的運行規則相結合，提出了一種啟發式調度演算法，通過在演算法中引入反映問題特徵的啟發函數，把廣度優先和深度優先搜索有機地結合，使得該演算法能夠在合理的時間復雜度內得到滿足精度要求的優化調度。
  19. Simulation results show that our algorithms performed better in terms of cost compared with gtm algorithm and have the same time complexity ( p3n2 )

    對于帶有多個約束的群播路由演算法，由於其採用改進了的成本函數，演算法的時間復雜度並沒有增加，也為（ p3n2 ） 。
  20. For the next interconnection network, we proved the connectivity of the n - enhanced crossed cube is n + 1, and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time, which is better than the hypercube and the crossed cube, two related algorithms in o ( n ) time are also given ; more, we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ), which is better than the hypercube and the crossed cube also

    本文證明n -維加強交叉立方體的連通度為n + l ，條件連通度為zn （ n > 3 ） ，簇容錯特徵數為（ n ， l ， zn ） ， （ : 1 > 3 ） ，這些性質都比交叉立方體的更優越。更進一步，木文也給出了加強交叉立方體的基於連通度的，條件連通度的時間復雜度為o （ n ）的容錯路由選擇演算法及最長路徑長度。
分享友人
分享到 Line

分享到臉書