The critical block based neighborhood structure of the problem in the local search procedure reduces the searching space of the problem and increases the probability of ants finding good solutions.
算法局部搜索过程中采用的基于关键路径的邻域结构缩小了问题的搜索空间。
New implementation of "Partition analysis", "Scan unused space", "NTFS structure search".
新的实现的分区分析，扫描未使用空间，NTFS结构搜索。
R-tree is a dynamic index tree of space search. Its structure use multi-dimensional region to express spatial data object. R-tree is a valid way to visit rectangle.
树是空间搜索的动态索引树，它的结构是利用多个维中的区间来表示空间数据对象，它是矩形访问的一种有效方法。
应用推荐