演算法執行時間 的英文怎麼說

中文拼音 [yǎnsuànfǎzhíhángshíjiān]
演算法執行時間 英文
algorithm execution time
  • 演 : 動詞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 （標...
  • 執 : Ⅰ動詞1 （拿著） hold 2 （執掌） take charge of; control; manage; wield 3 （堅持） persist in; sti...
  • 行 : 行Ⅰ名詞1 （行列） line; row 2 （排行） seniority among brothers and sisters:你行幾? 我行三。where...
  • 時 : shí］Ⅰ名1 （比較長的一段時間）time; times; days:當時at that time; in those days; 古時 ancient tim...
  • 間 : 間Ⅰ名詞1 （中間） between; among 2 （一定的空間或時間里） with a definite time or space 3 （一間...
  • 時間 : time; hour; 北京時間十九點整19 hours beijing time; 上課時間school hours; 時間與空間 time and spac...
  1. We ca n ' t divide the multiple streams time series into singleness times series simply in the research of multiple streams time series, we ' ll dissever the relation between the events of the multiple streams. although the msdd can find the dependency relationship of multiple streams, but it have n ' t the initialization of the events, the express of the time relationship between events is not frank, the cost of the algorithm is expensive ( o ( n5 ) ), i ca n ' t find much more knowledge in multiple time series, it find the dependency patterns only of the multiple time series, so there need a new more effective, frank, complete algorithm to find the knowledge

    研究多流時序不能簡單地將它割裂為單流時序，因為這樣就割裂了數據流事件之間的關系。雖然msdd能夠發現多流時間序列中的依賴模式，但是由於其缺少對數據的初始化、事件之間時間關系的表示不直觀、演算法執行的時間空間開銷很大（ o （ n ~ 5 ） ） 、不能夠充分發現多流時間序列包含的知識，它只發現依賴關系，因此研究新的，高效，全面的發現多流時間序列事件之間關系的演算法成為必要。本文分析了單一和多流時間序列中的知識發現，把多流時間序列事件內部存在的關系表示為：關聯模式、依賴模式、突變模式。
  2. Besides, of the several algorithms those have been proposed in the literature for solving the transportation problem, previous computational results indicated that the primal algorithm ( modi method ) is more efficient, so we have compared the amedv versus the modi method. because very little experimentation was carried out on algorithmic techniques used in the codes of amedv, we have also performed a number of runs that test the overall solution time as the number of significant digits in each of the parameters is varied

    因為元素判別值分配法是運輸問題引發出的求解新方法，並且階石法是目前解運輸問題的較快速解法，所以特別針對運輸問題通過若干組有代表性的檢驗數據進行數值測試，在實際問題中對比元素判別值分配法與階石法的演算法執行時間，研究兩對演算法執行效率上的差別，並分析差別產生的原因。
  3. Based on the fact of generating the synthetic data using poisson distribution function and exponential distribution function, the performance of hy algorithm and the comparison among hy algorithm, apriori algorithm and dhp algorithm is experimented. these experiments include the one that compares the execution time using variant synthetic data and variant minimum supports, and the scale - up one that compares the execution time using variant transaction number and variant item number in synthetic data. finally the results of the experiments are analysed

    在構造基於泊松分佈函數和指數分佈函數的合西南交通大學碩士研究生學位論文第iii頁成數據的基礎上，對hy演算法的性能及其與apriori演算法和dhp演算法的比較進行了實驗，這些實驗包括針對不同的合成數據和不同的最小支持度，對各演算法的執行時間進行比較的實驗以及針對合成數據的不同的事務數和不同的項數對各演算法的執行時間進行比較的規模實驗，並對實驗結果進行了分析，反映出hy演算法具有良好的性能。
  4. 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模式匹配演算法進行了并行化設計，並比較了原演算法和并行演算法的時間復雜度和執行代價。
  5. Not only realize scanning databases only one time and decrease i / o resources consumption, but also improve storage efficiency of data structure and time efficiency of mining algorithm

    不僅實現了事務數據庫的一次掃描，減少了i / o代價，而且提高了數據結構的存儲空間效率和頻繁閉項集挖掘演算法的執行時間效率。
  6. Based on summarized and analyzed the existing problems of the solution for scheduling rtrpmt and tft, the author constructs a new heuristic function which adequately takes predecessor and successor relation among tasks into account, targeting that the direct successor of current running task is to be given the earliest time to be run

    針對實時分佈系統中大量的相關周期性多任務，在分析、總結了前人對此類任務的調度演算法解決方案所存在的問題基礎上，構造了一種新的啟發函數，該啟發函數充分考慮了任務之間的前驅、后繼關系，以當前任務的直接后繼具有最早開始執行時間為目標。
  7. Parallel and distributed systems, 1993, 4 : 175 - 186. 4 singh h, youssef a. mapping and scheduling heterogeneous task graphs using genetic algorithms. in proc

    在異構環境中，通常採用啟發式調度演算法，這種演算法利用任務執行時間和系統負載的歷史數據來調度任務。
  8. The simulated experiment indicates that stbmr ’ s tree ’ cost is up to 4 % more than kpp, while average running time is 54 % less than it

    實驗表明， stbmr演算法構造的組播樹費用比kpp演算法構造的約大4 % ，演算法執行時間比kpp演算法約少54 % 。
  9. Pretreatment is used to generate alternate activities to achieve the requirements. theproblem after pretreatment is characterized as a constraint satisfaction problem, which is solvedby the local search algorithm based on dynamic priority. the solution means to specifycorrespondingactivitiesforeveryrequirementandtoallocateexecutingtimeandresources. in order to validate the modeling framework presented in this paper, a software system isdesigned to implement the mission planning and scheduling for msrs

    預處理過程自動生成完成任務需求的候選活動集;預處理之後的問題被描述為一個約束滿足問題，通過基於動態優先級的局部鄰域搜索演算法完成問題的求解，即為每個需求指定相應的活動，並為這些活動安排執行時間並指派資源。
  10. There exits contradiction between the qos guarantee and complexity of channel assignment algorithms. and the channel search time is correlated with the channel utilizing efficiency. so each solution plan is the compromise among these factors

    因為在系統的通信服務質量和通道分配演算法執行的復雜性之間存在矛盾，而且它與通道搜尋時間和通道利用率也有關系，所以任何一種解決方案的提出總是不同矛盾折中的結果。
  11. After analyzing the characteristic of the parallel processing system, some problems about design missile - carrying processing system are pointed out ; network in the parallel processing system has become bottleneck and affect the performance of system, so the processing efficiency is analyzed in a multiprocessor system based on cluster - bus and some rules in designing the network in the multiprocessor system are brought out ; genetic algorithm is used for scheduling in the multiprocessor system, and a scheduling algorithm is described to suit arbitrary number of tasks, unequal task processing time, arbitrary precedence relation among tasks and arbitrary number of parallel processor, so that the schedule length will be minimized ; finally, an atr algorithm is mapped to a ring multiprocessor system, and a block diagram using dsp device is constructed. in chapter 4, the study is performed on real - time system hardware realization of atr. tms320c80 is selected as the kernel processor in multiprocessor system

    為此，對一種由常用的dsp晶元組成的多處理器系統的處理器利用率進行了分析，提出了多處理器系統互連網路設計的基本原則；本章使用遺傳演算法作為實現多處理器調度的工具，提出了一種新的任務調度演算法，該演算法主要是為了解決在任務數任意、任務計算時間不相等、任務前趨關系任意、以及任務間存在通信和考慮任務存貯器要求的情況下，如何優化任務在各個處理器上的分配和執行順序，使得多處理器系統總的執行時間最小；最後對一個目標識別演算法進行了硬體實現優化分析，根據分析結果，將演算法映射到由dsp晶元組成的環形網路連接的處理器拓撲結構上，得到了多處理器系統的原理框圖。
  12. The algorithm inserts the dynamic voltage scaling code before the condition statements and after the loop statements, which affect the program execution time. the algorithm makes full use of the slack time for the running program and effectively reduces system power consumption

    該演算法在編譯器的幫助下，在條件語句，循環語句等影響程序實際執行時間的控制語句結構中設置電壓調節點，插入電壓調節代碼，從而最大限度的利用了程序運行時的空閑時間，達到了降低系統功耗的效果。
  13. But the standard mc has some shortcomings : firstly, the standard mc picks up isosurfaces by threshold, however, threshold segmentation is invalid for picking up tissues or organs from some medical images ; secondly, the standard mc pocesses cubes one by one, that is to say, all the cubes will be checked, and the algorithm spents 30 % - 70 % of time to check the null units, so we need a reasonable data structure to travel the space data and accelerate the checking or filting of null units ; thirdly, the standard mc has a large scale of triangles, normally, the tissue or organ reconstructed includes hundreds of thousands so much as millions of triangles, this means it hardly to execute real - time rendering or interaction ; lastly, the standard mc can not get the very smoothly surface mesh, and there will be some unexpected accidented cases, especially in the case of big errors in oringinal data

    但是標準mc演算法存在較大的問題:標準mc演算法實質上是通過閾值分割來提取等值面，閾值分割對某些醫學圖像的組織或器官的提取難以得到較好的效果;標準mc演算法是逐個移動立方體來進行處理，就是說對所有的立方體都要進行一次檢測，演算法執行中30 % ~ 70 %的時間用在對空單元的檢測上，因此需要有一種合理的數據結構對空間數據進行有效的遍歷，以加速對空單元的檢測和過濾;標準mc演算法產生了大量的三角面片，一般重建的組織或器官包含數十萬甚至上百萬的三角面片，難以實現實時的繪制和交互操作;標準mc演算法得到的表面網格並不光滑，會有一些不期望的凹凸，特別是在原始數據有較大誤差的情況下尤其突出。
  14. The optimal program execution time with rejuvenation

    的程序執行時間優化演算法
  15. In our simulation experiment in aglet, stochastic selecting method takes more time than ann method to prove our suppose correct. by learning agent can obtain a more superior result and get the basi s for reasonable choice host. this paper is organized as follow

    通過人工神經網路學習后的agent執行時間比隨機選擇時間少，並在aglet平臺對此演算法進行了模擬實驗，通過學習的agent能獲得較優的結果，為合理的選擇host提供依據。
  16. Association rules are an important aspect of research of data ming. the apriori algorithms is a kind of good algorithms to mine association rules

    Apriori演算法是關聯規則挖掘的主要演算法之一，但是由於要多次掃描海量數據庫，演算法的執行時間會很長。
  17. Simulation results show that the quick contour following algorithms can reduce the execution time of the standard contour following algorithm nearly 40 %

    模擬結果表明，大多情況下，快速演算法能夠將輪廓跟蹤的執行時間減少40 %以上。
  18. Experimental results also show that for every quantization width, every scale in time and every scale in space, 3d - pcw not only achieves higher compression rate but also costs less time than 3d - escot

    實驗數據也表明，對于每個量化幅度和每個空間及時間解析度， 3d - pcw不僅獲得了比3d - escot更高的壓縮比，而且演算法執行所需要的時間也更少。
  19. To ensure the effective utilization of resources and the fluent delivery of information, some key factors such as order, information, resources, the implementing time and overlapping time of activities are taken into account adequately

    綜合考慮了時序、信息、資源、活動執行時間、各活動的并行關系等關鍵因素，使演算法能夠保證資源的有效利用和信息的平滑流動。
  20. The executive time of the programs are dramatically shorted by searching the root of the equation and applying the iterative arithmetic

    並用根窮搜索法， bch碼的迭代演算法對程序進行優化，使程序的執行時間有量級的提高。
分享友人
分享到 Line

分享到臉書