This paper brings forward an optimizing memory algorithm by analyzing memory management.
通过对内存管理的分析，提出了内存优化算法。
Kanerva's memory algorithm could do several marvelous things that parallel what our own minds can do.
卡内尔瓦的记忆算法能做一些可媲美于人类思维的不可思议的事情。
Configure the H-Join to use in-memory algorithm - in the H-Join Step, after defining the parent and child lists, there is an option to select the algorithm that should be used.
配置H -Join以使用内存中算法—在H - JoinStep中，定义父列表和子列表后，有一个选项来选择应使用的算法。
It compresses warehouse tables with an efficient algorithm and stores them in memory.
它使用一种有效的算法压缩仓库表并将它们存储在内存中。
You can develop an algorithm that USES little memory for management but takes more time to manage the available memory.
您可以开发一种使用少量内存进行管理的算法，但是要花费更多时间来管理可用内存。
Whether the object is freed depends on the algorithm of the garbage collector as well as the amount of memory available while the collector is running.
对象是否被释放取决于垃圾收集器的算法以及垃圾收集器运行时可用的内存数量。
VMM actually has a memory load control algorithm, which can detect if the system is thrashing and actually tries to remedy the situation.
实际上，VMM中提供了一种内存负载控制算法，它可以检测系统是否出现颠簸，并尝试去解决这种情况。
Kanerva's algorithm was an elegant method to store a finite number of data points in a very immense potential memory space.
卡内尔瓦的算法是一种将有限数量的数据点储存进非常巨大的潜在的内存空间的绝妙方法。
You can also develop an algorithm that efficiently manages memory but USES a bit more memory.
也可以开发一个算法来有效地管理内存，但却要使用更多的内存。
This paging algorithm determines which virtual memory pages currently in ram ultimately have their page frames brought back to the free list.
这种分页算法可以确定对当前位于RAM中的哪些虚拟内存页面的页帧进行回收，并放回到空闲列表中。
The copying algorithm has excellent performance characteristics, but it has the drawback of requiring twice as much memory as a mark-sweep collector.
复制算法的性能很优异，但是它有一个缺点是需要两倍于标记-清除收集器所需要的内存。
Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.
合并排序本身并非并行算法，因为它可以顺序执行。当数据集太大，内存无法容纳，必须分片保存的时候，经常使用合并排序。
The virtual memory subsystem has been enhanced with a reverse-mapping algorithm, which provides improvements in memory constrained systems.
通过使用反向映射算法，虚拟内存子系统已经得到了提高，这为内存受限的系统带来了改进。
The virtual memory pages whose page frames are to be reassigned are selected using the VMM's page replacement algorithm.
可以使用VMM的页面置换算法来选择要重新分配页帧的虚拟内存页面。
Virtual memory subsystem enhancements, including a reverse-mapping algorithm that provides improvements in memory-constrained systems.
虚拟内存子系统改进，包括在内存压力比较大的系统中提供的反向映射算法。
The heap manager looks at the available memory (using a particular algorithm) and returns the block.
堆管理器会查看可用内存的情况(使用特定算法)并返回一块内存。
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能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
Now let's reset the quantum memory, and run Deutches algorithm.
现在让我们重置量子内存并运行deutsch算法。
The VTMemory class represents an area of memory where the allocation mechanism can use any algorithm and hence can vary in time.
VTMemory类表示的内存域则是这样的，其内存分配机制可以使用任何算法，因此时间也是千差万别的。
This algorithm tends to be memory efficient (allocating what's necessary) but requires more time to manage the heap.
这种算法通常具有较高的内存使用效率(分配需要的内存)，但是却需要花费更多时间来对堆进行管理。
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)算法删除条目。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
Because the page replacement algorithm is always looking for free frames while it is doing its scanning on systems with a lot of memory, the number of frames to scan can be significant.
在对有大量内存的系统进行扫描时，因为页面置换算法始终寻找空闲帧，所以需要扫描的页帧数量非常大。
The VMM has a page-replacement algorithm, which assigns the page frames and determines exactly which virtual-memory pages currently in RAM will have their page frames brought back to the free list.
VMM 提供了一种页面置换算法，该算法用于分配页帧，以及确定应该将当前RAM 中的哪些虚拟内存页面的页帧置换回空闲列表。
IE7's naive concatenation algorithm requires that the browser repeatedly copy and allocate memory for larger and larger strings each time through the loop.
IE7天真的连接算法要求浏览器在循环过程中反复地为越来越大的字符串拷贝和分配内存。
We derive the algorithm and parameters estimate method for the MAP restoration, and propose the image sectioning to speed up the restoration and save memory space.
针对MAP法提出了具体算法和参数估计方法。并提出应用图象分割法来提高计算机复原速度，节省存储空间。
A simplified objective function and a modified clonal algorithm (CLONALG) based on memory are proposed.
将二层规划目标简化为分段函数，提出基于记忆的改进克隆算法。
This paper introduce the rollback checkpointing algorithm in the retry-recovery technique. In order to reduce the system overhead, it presents a scheme implementing in the virtual memory.
本文介绍了容错重算恢复技术中的向后滚动检查点算法。并针对减少系统开销的问题，提出了在虚拟存贮器中的一种实现方案。
We use an address symbolic value propagation algorithm to derive possible address set that might be accessed by a memory instruction.
我们通过一种值预测及传播算法检测存储器指令数据相关。
We use an address symbolic value propagation algorithm to derive possible address set that might be accessed by a memory instruction.
我们通过一种值预测及传播算法检测存储器指令数据相关。
应用推荐