查询词典 parallel algorithm

A smooth approximation algorithm is then proposed based on hinge-finding algorithm via curved faces approximated to the hinging hyperplanes model, which can obtain a smooth approximation result and hold some good properties of hinge-finding algorithm such as simplicity and effectiveness.

本文对找链接算法做了两点改进，其一是扩充了链接超平面模型，在二维空间上弥补了链接超平面模型表示能力不足这一弱点。仿真实验显示使用扩充后的模型得到了更好的分片线性逼近结果。另一点改进是使用双曲光滑函数构造出了基于找链接算法的光滑逼近算法。理论分析证明了算法的可行性。仿真实验验证了理论分析。

It generalized the traditional k-means algorithm from the point of view of prototype selection. In detail, the kPC algorithm substituted hyperplanes for points used in k-means algorithm to be the prototypes and got these hyperplanes by minimizing the sum of the squared distances between each point and its closest hyperplane.

它从原型选择的角度推广了传统的k-均值算法，用超平面替代k-均值算法中的中心点来表示聚类原型，并通过最小化样本点到最近中心超平面平方距离之和来求取原型超平面。

The results of computations demonstrate that the path relinking algorithm can obtain better solutions than the standard genetic algorithm, the standard Tabu search procedure and the general path relinking algorithm, and prove that the solution update method of the reference set with diversification detection is very important to path relinking. Moreover, the decentralization mutation strategy can enhance the capacity of searching a better solution.

计算实例表明，该路径重连算法比标准遗传算法、标准Tabu搜索算法以及普通路径重连算法能够获得更好的解，证明了多样性检测对参考解集更新的关键作用以及分散性解变异策略在提高解的质量上的能力。

ehta algorithm of artificial intelligence is the heuristic search theory analysis and improvement, and design of a suitable timetabling algorithm, it contains a side strategy, choosing bad strategy, tactics, learning strategy prospects detection, etc. ehta algorithm used in universities in system, reduce artificial intervention, reasonable arrangement of course, teachers and balanced class teacher of load on the good effect, can greatly improve the efficiency of course.

ehta算法是对人工智能中的启发式搜索理论加以分析和改进，设计的一种适用于高校排课的算法，它包含了靠边策略、择劣策略、前景探测策略、学习策略等内容。ehta算法应用在高校排课系统中，在减少人工干预排课次数、科学安排教师、均衡班级和教师的日负荷等方面起到了良好的效果，大大提高了排课效率。

The algorithm is implemented by a three-stage iterative process. At the first stage, an iterative block matching algorithm is applied to generate more accurate initial disparity vectors, and at the second stage, an iterative polygon matching algorithm is employed to optimize the initial disparity vectors obtained at the first stage to minimize the error of certain triangulations. Finally at the third stage, the unreliable nodes are deleted.

该方法是一个三步迭代过程：首先利用迭代块匹配算法得到较精确的匹配结果；然后利用迭代多边形匹配算法对得到的匹配结果进行优化，使得一些三角形的预测误差最小；最后删除掉视差不可靠的节点。

Based on analyzing the algorithms of Delaunay triangulation creation in domestic and abroad, in view of the situation of building DTM and the need of realizing railway 3D visual design, a divide-and-conquer algorithm to build DTM is presented, the algorithm use square grids to manage disordered points, to form triangular meshes in grids, DTM can be obtained by merging the triangular meshes, so that the work of sorting of the disordered points before building DTM is reduced greatly; moreover, the algorithm utilize subarea to control the vertices of convex hull so that the range which support points locate in can be predefined when searching support points, the workload of searching support points can be reduced and the speed of merging two triangulations is raised.

在分析了国内外构建DTM算法的基础上，针对DTM算法的现状及铁路线路三维可视化设计的需要，创立了一种构建DTM的分治算法。算法引入方格网管理离散点数据，在格中构建三角网，然后再将这些三角网合并形成DTM，极大地减少了构网前对所有参加构网的离散点进行排序的工作量。此外，通过对凸包顶点数据进行分区管理，在搜寻凸包支撑线时，能预先确定出支撑点的范围，减少了搜索工作量，提高了三角网的合并速度。

This paper introduces TSP firstly,and then discusses the six effective methods generallyGenetic algorithm,Ant Colony algorithm,Hopfield Neural Network,Simulated Annealing algorithm,Artificial Immune alg...

文章介绍了什么是TSP，论述了目前求解旅行商问题较为有效的六种智能算法(遗传算法、蚁群算法、Hopfield神经网络算法、模拟退火算法、人工免疫算法、混合优化算法)，并简单阐述了其优缺点，给出了未来针对TSP问题的研究重点。

In this paper we propose a new image reconstruction algorithm for electrical impedance tomography-Quasi-Newton algorithm, based on modified Bk. Numerical tests were made to verify the effectiveness of this algorithm.

本文提出了一种新的电阻抗成像图像重建算法—基于修正Bk的拟Newton类算法，并通过数值试验验证了该算法的有效性。

In this paper we propose a new image reconstruction algorithm for electrical impedance tomography-Quasi-Newton algorithm, based on modified Bk. Numerical tests were made to verify the effectiveness of this algorithm.

摘 要 本文提出了一种新的电阻抗成像图像重建算法—基于修正Bk的拟Newton类算法，并通过数值试验验证了该算法的有效性。

Multiple trials is the basic concept of many parallel simulated annealing. It is to perform multiple trials at the same time to search acceptable solutions. The division simulated annealing with no communication and The clustering simulated annealing are two common types of parallel simulated annealing methods. The division simulated annealing with no communication makes each processor generate its own adjacent solution from its own current solution and compute the acceptance probability for a adjacent solution. Each of the processors searches solutions without communicating each other. Clustering simulated annealing makes each processor generate its own adjacent solution from a common current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should be used to replace current solution according to a pre-specified rule.

许多平行模拟退火法之理论依据为多向试验，利用同一时间探索更多方向的试验来拓展搜寻的广度或深度，不进行沟通的分工模拟退火法(the division simulated annealing with no communication)以及丛集模拟退火法(the clustering simulated annealing)皆为平行化的模拟退火法，前者定义为各个处理器针对各自的起始解进行搜寻，产生各自的搜寻序列，在搜寻过程中处理器不进行任何沟通，各处理器仅针对自身之目前解进行搜寻；而后者定义为让所有处理器针对同一目前解进行运算搜寻各自的可能解，并各自决定其产出解之接受机率，最后根据事先决定之规则进行沟通比较，挑选其中一个可接受解取代目前解。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样