algorithm execution time 中文意思是什麼

algorithm execution time 解釋
演算法執行時間
  • algorithm : n. 【數學】演算法;規則系統;演段。
  • execution : n 1 實行,履行,執行;貫徹。2 執行死刑;強制執行;執行命令。3 作成,完成;簽名蓋印使法律文件生效...
  • time : n 1 時,時間,時日,歲月。2 時候,時刻;期間;時節,季節;〈常pl 〉時期,年代,時代; 〈the time ...
  1. 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演算法具有良好的性能。
  2. In design flow modeling, a new design flow model definition method based on object oriented colorful petri net is put forward. in sub _ task dispatching, the task database, the task dispatch algorithm, the task dispatching time and its amending algorithm, the task dispatching execution plan etc. are designed. in version management, the version model of design object is built and the relationship between the linkers in dfms model and the version model about design objects is studied

    在相關的關鍵技術研究中,提出了一套包括通信模型的建立、通信原語的設計、通信服務器的設計等內容在內的被動式協同設計通信方案;設計了一種基於面向對象有色petri網技術的設計流程模型定義方法;提出了一種基於調度時間和資源狀況的子任務調度方案,並完成了任務數據庫的設計、子任務調度演算法的設計、子任務調度時間及其修正演算法的設計和子任務調度實施方案的設計等工作;建立了設計對象的版本模型,研究了設計流程模型的各種連接器與設計對象各種版本間的對應關系。
  3. Describes the design and realization of partial run - time reconfigurable fpga in detail. in order to reduce the affect of the reconfiguration time on system execution time, mostly static circuit design method in logical design stage and incremental routing method in component implementation stage are proposed. the fft parallel processing algorithm is examined through vvp platform

    本章詳細闡述了基於vvp平臺的多sharc功能插板的具體硬體實現,以動態重構fpga設計為核心,論述了局部動態重構fpga設計流程和方法,提出了極大靜態電路邏輯設計方法和遞增式布線方法,以達到減小動態重配置時間,提高系統運行效率的目的。
  4. 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

    該演算法在編譯器的幫助下,在條件語句,循環語句等影響程序實際執行時間的控制語句結構中設置電壓調節點,插入電壓調節代碼,從而最大限度的利用了程序運行時的空閑時間,達到了降低系統功耗的效果。
  5. A heuristic task scheduling algorithm satisfying resources load balancing on grid environment is presented. the algorithm schedules tasks by employing mean load based on task predictive execution time as heuristic information to obtain an initial scheduling strategy

    由於網格資源具有動態自治和異構等特性,網格環境下的資源管理更加具有挑戰性,其中,任務調度是一個非常重要的問題。
  6. When the ratio of the execution time of point additions to that of point doublings is 3 during computing scalar multiplication, the parallel efficiency of the proposed algorithm could be best, 90 %

    當計算標量乘的點加時間是點倍數時間的3倍時,其并行效率最高可達到90 % 。
  7. Simulation results show that the quick contour following algorithms can reduce the execution time of the standard contour following algorithm nearly 40 %

    模擬結果表明,大多情況下,快速演算法能夠將輪廓跟蹤的執行時間減少40 %以上。
  8. At first, we present fault - tolerant mobile agent execution as a sequence of agreement problems ; then, we design a div consensus algorithm in order to solve the agreement problems ; at the same time, we give a pipelined mode for reliably forwarding the agent between stage s and si + i

    其中,我們首先將移動agent的容錯執行問題轉換為一系列的協議協商問題;然後在consensus演算法的基礎之上通過改進給出了divconsensus演算法用以實現移動agent之間的協商策略從而最終保證移動agent執行的只一次屬性;同時我們還提出了一種用於實現移動agent在不同階段之間高效可靠傳輸的通道模式。
分享友人