Block-by-block searching algorithm was improved on the basis of local search algorithm that based on critical block.
逐块搜索算法在基于关键块的局部搜索方法基础上进行改进。
Using a new neighborhood structure and partly randomized off-trap strategy, a novel local search algorithm for protein structure prediction is proposed.
构造了新的邻域结构，采用了部分随机跳坑策略，对此问题提出了新的局部搜索算法。
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.
针对混合流水车间调度问题，提出了分阶段加工优先级的调度原则，并将迭代局部搜索算法应用于求解此问题。
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.
其次，在对工序任务之间的逻辑关系深入分析的基础上，提出一种基于过滤束算法思想与基本邻域搜索算法相结合的混合算法。
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.
特别的，我还将介绍本地搜索算法的接近查询，和一个局部聚类的节点加权方法，以及网络的网络模型集成多个网络。
Based on the pheromone updating strategy, local search algorithm, the probability of randomly selected three areas to improve, improve the algorithm's global search ability and convergence of optimal.
通过对信息素更新策略、局部搜索算法、随机选择概率三个方面的改进，提高算法的全局最优搜索能力和收敛性。
The algorithm consists of Cell Shape, Graph Search, Local Path Planning, Cell Splitting, Probabilistic Sampling.
该算法主要由栅格形状，图搜索，局部规划器，栅格分解，栅格抽样等部分组成。
The algorithm includes selection, expansion and mutation operations, expansion is used for local search and mutation is used for global search in solution space.
算法包括选择、扩展和突变操作，扩展和突变操作分别在解空间中局部和全局范围内搜索最优解。
Heuristics mutation operator and local search scheme are designed in the algorithm.
该算法采用新的启发式变异算子和局部搜索算子。
In this paper, to improve the original one, an algorithm of two-phase parsing with local search strategy.
针对这些问题，对原始算法进行了一定的改进，引进了局部搜索算法和两阶段分析。
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.
标准的粒子群优化算法作为一种随机全局搜索算法，因其在种群中传播速度过快，易陷入局部最优解。
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 -交换变异算子，增强了算法的局部搜索能力，提高了解的质量。
Direct search feasible direction (DSFD) is an effective algorithm for solving the constrained non-linear programming problem, however, it could only find the local optimal solution.
转轴直径搜索可行方向法(DSFD方法)是一种比较有效的求解有约束非线性规划问题的算法，但它只能得到局部最优解。
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.
该算法的思想是采用混沌初始化进行改善个体质量和利用混沌扰动避免搜索过程陷入局部极值。
A fast border-detection algorithm named local border search algorithm was presented here, and applied to an on-line surface inspection system for cold rolled strips.
提出一种快速的边部检测算法，即边界局部搜索算法，并应用于冷轧带钢表面缺陷在线检测系统。
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规划局部极小解的邻域搜索算法，在此基础上给出了填充函数算法。
As a classical partition clustering algorithm, CLARANS USES local search with random restart to find clusters central points.
CLARANS算法是经典的划分聚类算法，其核心思想是采用随机重启的局部搜索方式搜索中心点。
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.
该算法通过在粒子群算法中引入蚂蚁算法，可有效克服粒子群算法后期的局部搜索能力差和蚁群算法前期盲目搜索的缺陷。
Although the algorithm has good global search capability, but for the local search space problem is not very effective.
遗传算法虽然具有良好的全局搜索能力，但对于局部空间的搜索问题不是很有效。
The memory unit mechanism is proposed to strengthen the local search ability of the algorithm and its calculation speed has been improved.
并采用记忆单元机制，增强了算法局部搜索的能力，提高了其计算速度；
The memory unit mechanism is proposed to strengthen the local search ability of the algorithm and its calculation speed has been improved.
并采用记忆单元机制，增强了算法局部搜索的能力，提高了其计算速度；
应用推荐