oblivious algorithm 中文意思是什麼
oblivious algorithm
解釋
漠視演算法-
Based on this extended model, we then propose an oblivious algorithm that can route messages between any two nodes in o expected number of hops. our routing algorithm keeps only o beta 1 bits of information on each node, where 1
Kleinberg證明了如果每個節點只用local的路由信息，簡單的貪婪演算法可以在o lg n 2的期望時間內完成任何兩點間的路由過程。 -
By introducing an oblivious policy and sorting chinese characters in accordance with their dynamic frequencies, the algorithm made important improvements on the average search length of chinese characters, which could better guarantee the strict demand on time of any application driven by the dyanmic statistics of chinese texts
由於引進了動態遺忘機制以及根據頻率動態調整漢字順序，演算法的平均查找長度成倍縮短，從而能夠更有效地保證涉及大量漢字信息檢索操作的應用對時間性能的要求。 -
The goal of a cache - oblivious algorithm is to be optimal in the use of the memory hierarchy, but without knowing any parameters of the hierarchy
高速緩存參數無關演算法的目標是，在不了解任何有關各層次參數的情況下，最優地使用存儲系統。 -
To alleviate this, the notion of cache - oblivious algorithm and the ideal - cache model were developed by prokop etc. in 1999
為了克服這一點， 1999年prokop等人提出了高速緩存參數無關演算法和理想高速緩存模型的概念。 -
We then do a performance investigation, comparing cache - oblivious algorithms with traditional ram - model algorithms. in the last, on the basis of thorough research, we present an optimal sub - linear working space cache - oblivious sorting algorithm. we conclude that cache - oblivious algorithms do outperform traditional ram - model algorithms when working on large data sets
接著通過性能測試，把高速緩存參數無關演算法與傳統的基於ram模型的演算法做了比較，最後，在深入研究的基礎上提出了一個最優的子線性工作空間的高速緩存參數無關的排序演算法。
分享友人