选择一个页面来交换存储的过程被称为一个页面置换算法，可以通过使用许多算法(至少是最近使用的)来实现。
The process by which a page is selected to swap to storage is called a page-replacement algorithm and can be implemented using a number of algorithms (such as least recently used).
VMM一直在后台运行，尝试使用前面介绍的页面置换算法偷取最近没有引用过的页帧。
VMM is constantly lurking and working in the background trying to steal frames that have not been recently referenced, using the page replacement algorithm discussed earlier.
在末日算法中使用最近的锚日是关键。
The use of a nearby anchor is the key to the doomsday algorithm.
使用LRU(最近较少使用)算法从缓存中逐出的条目有多少。
How many items were evicted from the cache using the LRU (least recently used) algorithm?
首先，缓存会实现最近最少使用的算法，使得 ASP.NET能够在内存运行效率较低的情况下强制缓存清除——从缓存自动删除未使用过的项目。
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.
如果使用最近邻算法回答我们上面遇到的“第5个顾客最有可能购买什么产品”这一问题，答案将是一本书。
To answer the question "What is Customer No. 5 most likely to buy?" based on the Nearest Neighbor algorithm we ran through above, the answer would be a book.
dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。
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.
内存区域是一个使用最近最少算法（Least RecentlyUsed，LRU）的纯内存缓存区域。
The memory region is a pure-memory cache region that uses a Least Recently Used (LRU) algorithm.
在此基础上，采用基于柱图的定位方法，使用迭代最近点算法进行地图匹配，提高了定位精度。
On the basis of this, a pole-map based localization was introduced which does map-matching using iterative closest points and can enhance the accuracy of localization.
这主要是因为算法使用了K-近邻方法来求解最近邻点。
The reason is that the algorithm searches the nearest neighbor points with K-nearest neighbor.
基于内容的过滤算法大多数是基于向量空间模型的算法，其中广泛使用的是朴素贝叶斯算法和K最近邻（KNN）算法。
Most of the content-based filtering algorithms are based on vector space model, of which Naive Bayes algorithm and K-Nearest Neighbor (KNN) algorithm are widely used.
目前最近距离扫描算法使用迭代法来计算最近距离点，计算量较大，迭代算法的收敛性对扫描算法的整体性能有较大的影响。
Currently, the iterative method is used to calculate the nearest points in scanning the nearest distance, which requires a large amount of calculation.
目前最近距离扫描算法使用迭代法来计算最近距离点，计算量较大，迭代算法的收敛性对扫描算法的整体性能有较大的影响。
Currently, the iterative method is used to calculate the nearest points in scanning the nearest distance, which requires a large amount of calculation.
应用推荐