The cache technology in the MANET environment is studied and a cooperative cache algorithm among groups is proposed.
对MANET环境下的缓冲技术进行了研究，提出了一种组间协作缓冲算法。
The first is that the Cache implements a least-recently-used algorithm, allowing ASP.NET to force a Cache purge—automatically removing unused items from the Cache—if memory is running low.
首先，缓存会实现最近最少使用的算法，使得 ASP.NET能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
To simulate this scenario, we developed an algorithm that invalidated 25% of the cache entries every twenty minutes - similar to the effect that is caused by a live inventory feed.
为了模拟这一场景，我们研发了一个算法，每20分钟作废整个缓存的25%—类似于实时库存清单产生的效果。
How many items were evicted from the cache using the LRU (least recently used) algorithm?
使用LRU(最近较少使用)算法从缓存中逐出的条目有多少。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
There's an algorithm you can use to tune the EJB cache size of the container that calculates the average EJB cache requirements based on the different kinds of beans.
有一个算法可以用来调整容器的EJB缓存大小，它根据不同类型的bean来计算平均eJB缓存需求。
The Tellurium Engine then USES the Santa algorithm to locate the whole UI module and put it into a cache.
接着TelluriumEngine使用Santa算法，定位整个UImodule，并将其存在缓存中。
Entries for the dentry cache are allocated from the dentry_cache slab allocator and use a least-recently-used (LRU) algorithm to prune entries when memory pressure exists.
dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。
Time-based cache attacks analyzes the time difference in the execution of algorithm over a processor, and recovers the secret key.
基于时间的缓存攻击是指通过分析处理器中算法的不同执行时间来恢复密钥的攻击。
Meanwhile, applying the algorithm to the process of dispatching can improve the scheduling efficiency of requests and cache hit ratio of nodes.
同时，在集群分发过程中应用该算法，可提高请求的调度效率和节点的缓存命中率。
It describes in structure and principle of ABWC and discusses transparency, consistency, replacement algorithm, prefetching policy and other main problems which need to be solved in cache designing.
描述该框架的组成结构与工作原理，对缓存设计时需要解决的透明性、一致性、替换算法和预取策略等主要问题进行讨论并给出性能测试和分析。
A cache allocation algorithm that applies to the mobile streaming media system is put forward to make the total integrated saving of all the streaming media program maximal.
提出了适用于移动流媒体系统的，使所有流媒体节目的总的综合节省值最大的缓存分配算法。
This paper introduces an algorithm which is based on real time experiments and implemented in high level language to obtain parameters of CACHE performance. It has preferable practical value.
论文介绍了一种用高级语言实现、通过实时实验的手段获取CACHE系统性能参数的算法，该算法有较好的实用价值。
A reasoning-oriented context replacement algorithm (CORA) is presented, which aims at promoting the hit rate of context cache and reducing the overhead of context transmission.
面向推理的上下文缓存置换算法CORA的目标是使上下文缓存达到较高命中率，有效节省普适计算中传输上下文的开销。
The simulation results show that the algorithm based on expectation prediction value achieves higher prediction hit rate of cache and lower average waiting delay than the algorithm based on FIFO.
仿真实验结果表明，该算法与传统的FIFO算法相比较，提高了缓存的预测命中率，减少了用户平均等待延迟。
The recovery algorithm of the distributed directory based on Directory Cache takes the directory caches as a hint to recover the directory approximately and quickly.
基于目录缓存的恢复算法采用目录缓存作为恢复的线索来近似地恢复目录，该算法能快速地恢复目录。
This algorithm greatly improves the accuracy of the routing cache and efficiency, and can adapt to the changes of topology better.
该算法较大地提高了缓存路由的准确率和效率，更理想地适应了拓扑结构的变化。
This polling is expensive and might need to be adjusted as a tradeoff between reaction speed of the cache-trimming algorithm and number of polling calls made.
轮询的开销很高，可能需要对其进行调整，在缓存清理算法的反应速度与轮询调用次数之间进行折中。
Simulation proves that, by employing the NCB algorithm, the cache hit rate can be improved obviously and the total network cost can be decreased effectively.
仿真实验结果显示，NCB算法有效提高了缓存命中率，降低了传送流媒体所消耗的总体网络代价；
A knowledge-aware based Web cache replacement algorithm whose merits and defects are compared by CWIS experiments is proposed and evaluated objectively.
提出了一种内容识别的代理缓存覆盖算法，通过实验比较了该方法的优缺点，并作出了客观的评价。
This paper introduces an algorithm which is based on real time experiments and implemented in high level language to obtain parameters of CACHE performance.
论文介绍了一种用高级语言实现、通过实时实验的手段获取CACHE系统性能参数的算法，该算法有较好的实用价值。
Use of document storage systems such information, the use of tabs collision Hash algorithm, with the latest data cache memory to achieve efficient information retrieval.
利用文件系统存储这些信息，利用Hash碰撞分页算法，加上最新数据的内存缓存，实现高效的信息检索。
A buffering based cache-oblivious nest-loop parallel join algorithm is proposed.
提出了一种基于缓冲的高速缓存参数无关的嵌套循环并行连接算法。
The LRU-like algorithm is proposed for the block management of augmented cache scheme.
提出了一个用于扩充高缓块管理的近似LRU算法。
The LRU-like algorithm is proposed for the block management of augmented cache scheme.
提出了一个用于扩充高缓块管理的近似LRU算法。
应用推荐