搜索资源列表
nt1
- mpi 结合vc编程用模拟退火法算一个最小路径的值-MPI programming combined with simulated annealing count path of a minimum value
parallel-dijkstra 并行化思路实现dijkstra算法
- 并行化思路实现dijkstra算法。假设有p个处理器，N个顶点。给每个处理器分配N/p个顶点，求出局部的最小值，复杂度为O (N/p)。然后后一半的处理器将自己的最小值发送给第前p/2个处理器。前一半处理器接收到传来的值后，与局部的最小值比较，作为新值。继续循环，直到剩下一个处理器为止。-Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex. Give each processor distributi
Mathmatics_Analysis
- 计算函数，为求某一函数的最小值。其中自变量的个数为2个。可自己设定。-Calculation function, for the sake of the minimum value of a function. In which the number of independent variables for the two. Can be set.
constrainedcircle
- 研究各种拟合圆的方法,提出了一个圆的代数距离表示法的系数约束条件,在此约束条件下讨论圆的几何特征参数的估计问题,并给出了特征参数在约束条件下的最小二乘估计.实例验证表明,文中算法比一般最小二乘法具有更高的拟合精度. -Various methods of fitting a circle, a circle is proposed algebraic representation of the coefficient of distance constraints, under the co
complex-method
- 约束优化的复合型法，寻找优化问题的最优点和最优值-This function offers a function to solve the minimum point and minimum value of a constrained optimization problem by using complex method
76076324Bellman_Fordautomatique
- bellmanford算法他可以计算网络的最小值-bellmanford algorithm can calculate the minimum value of the network
graphmin
- 求图最小点，给定一个联通量。求最小节点，具体过程有注释-graph minimum