In particular, I will introduce a local search algorithm for proximity query, a node weighting method for local clustering, and the network of networks model for integrating multiple networks.
特别的，我还将介绍本地搜索算法的接近查询，和一个局部聚类的节点加权方法，以及网络的网络模型集成多个网络。
In this paper, to improve the original one, an algorithm of two-phase parsing with local search strategy.
针对这些问题，对原始算法进行了一定的改进，引进了局部搜索算法和两阶段分析。
It adopts 2-interchange mutation operator in ant colony algorithm to increase its ability of local search and to improve the quality of the solution.
该算法通过在蚁群算法中引入遗传算法的2 -交换变异算子，增强了算法的局部搜索能力，提高了解的质量。
The basic principle of CPSO algorithm is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum.
该算法的思想是采用混沌初始化进行改善个体质量和利用混沌扰动避免搜索过程陷入局部极值。
Multistage processing priority was developed for the hybrid flow shop problem and an iterated local search algorithm was used for solving this kind of problem.
针对混合流水车间调度问题，提出了分阶段加工优先级的调度原则，并将迭代局部搜索算法应用于求解此问题。
To improve the efficiency of the algorithm, the local enhanced operator is proposed to make some individuals of the population search around the current best individual.
本文通过引入局部增强算子，使种群中的部分个体在当前最优个体附近寻优，以加快算法的收敛速度。
The proposed algorithm could enhance the search efficiency of GA by compressing the search space and improve the local search ability by use of improved optima flow pattern algorithm.
该算法既通过压缩寻优空间提高了遗传算法的搜索效率，又利用改进最优流法改善了局部寻优能力。
Combining PSO and ACS, the proposed algorithm can effectively avoid the local optima of PSO algorithm and the blindness search of ant colony algorithm.
该算法通过在粒子群算法中引入蚂蚁算法，可有效克服粒子群算法后期的局部搜索能力差和蚁群算法前期盲目搜索的缺陷。
The proposed hybrid algorithm had the global search ability of chaotic search as well as local search ability of pattern search method.
该优化算法具有混沌优化的全局搜索能力，而模式搜索法则加快了局部寻优性能。
Secondly, based on the analysis of the relationship between the processing tasks, a hybrid algorithm combined the filtered beam search algorithm with the local search algorithm is proposed.
其次，在对工序任务之间的逻辑关系深入分析的基础上，提出一种基于过滤束算法思想与基本邻域搜索算法相结合的混合算法。
On the basis of this thought, we have put forward and found the method for classification rules discovery based on local search and Ant algorithm combined together.
在该思想的基础上，提出了基于局部搜索和蚁群算法相结合的分类规则发现方法。
Block-by-block searching algorithm was improved on the basis of local search algorithm that based on critical block.
逐块搜索算法在基于关键块的局部搜索方法基础上进行改进。
The standard particle swarm optimization algorithm as a random global search algorithm, because of its rapid propagation in populations, easily into the local optimal solution.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
As for local search which influenced the effectiveness of the algorithm seriously, a local search method named block-by-block searching algorithm was designed.
针对对算法效率有极大影响的局部搜索，设计了一种名为逐块搜索算法的局部搜索方法。
Simulated annealing mechanism is introduced to do local-search for the best chromosome in every generation of the evolution process. This improves the convergence of the algorithm.
算法引入模拟退火机制，在遗传进化过程中的每一代，对最优个体进行邻域局部寻优，利用模拟退火进一步改善算法的收敛性能。
In the NPDE algorithm, the initial population was divided into three subpopulations based on the fitness values of individuals, which were employed for global and local search respectively.
基于种群个体的适应度值，该算法将种群个体分为三个子种群，分别用于全局搜索、局部搜索及二者的结合。
This algorithm overcomes the poor local search capability and the precocious phenomena of the traditional GA, and also effectively improves the global search ability of the SA.
该算法有效克服了传统GA局部搜索能力差和早熟现象，同时也有效改善了SA全局搜索能力差的问题。
But simulated annealing algorithm also has weak point, that it is not very satisfactory of avoiding falling into local minimum and search capability and area of solution space.
然而模拟退火算法依然存在着其自身的不足，即避免陷入局部极小值以及解空间的搜索能力和范围这两项指标不是很理想。
This paper presents a neighborhood search algorithm for finding a local minimal solution of the problem, then a filled function method for solving 0-1 programming is proposed.
文章首先给出搜索0-1规划局部极小解的邻域搜索算法，在此基础上给出了填充函数算法。
The algorithm consists of Cell Shape, Graph Search, Local Path Planning, Cell Splitting, Probabilistic Sampling.
该算法主要由栅格形状，图搜索，局部规划器，栅格分解，栅格抽样等部分组成。
The algorithm uses the thought of delamination, makes local planning and global planning combination, and improves cost function, finally with ensuring optimal trajectory increases search efficiency.
该算法采用分层思想，将局部规划与全局规划相结合，并对代价函数进行了改进，在保证航迹优化的基础上，提高了搜索效率。
The algorithm uses the thought of delamination, makes local planning and global planning combination, and improves cost function, finally with ensuring optimal trajectory increases search efficiency.
该算法采用分层思想，将局部规划与全局规划相结合，并对代价函数进行了改进，在保证航迹优化的基础上，提高了搜索效率。
应用推荐