搜索资源列表
mmas
- 采用C++语言编写最大最小蚁群优化算法程序，解决问题-using C language largest smallest ant colony optimization algorithm to solve problems
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
Mtrix_minPath
- 求图的任意两点之间最小路径的算法，利用了矩阵乘的原理-Order to map the smallest path between any two points in the algorithm, using the principle of the matrix multiply
smosvm
- 一个向量机（svm）的 序列最小优化算法源码,该算法可用来开发svm的并行算法！-A vector machine (svm) the sequential minimal optimization algorithm source code, the algorithm can be used to develop parallel algorithms svm!
constrainedcircle
- 研究各种拟合圆的方法,提出了一个圆的代数距离表示法的系数约束条件,在此约束条件下讨论圆的几何特征参数的估计问题,并给出了特征参数在约束条件下的最小二乘估计.实例验证表明,文中算法比一般最小二乘法具有更高的拟合精度. -Various methods of fitting a circle, a circle is proposed algebraic representation of the coefficient of distance constraints, under the co
76076324Bellman_Fordautomatique
- bellmanford算法他可以计算网络的最小值-bellmanford algorithm can calculate the minimum value of the network
FSJTBXCY
- 时间交替并行采样技术，最小均方误差时钟失配误差算法-good thing
volterra6
- 运用volterra级数来分析求解其二阶核，包括运用各种算法，比如脉冲激励法，最小二乘法-Use volterra series analysis to solve the second-order core, including the use of various algorithms, such as pulse excitation method, least square method, etc.
MyGA-master
- 将节点按内存情况排序 将任务按内存需求情况排序 规则：将内存需求最小的节点先行分配在内存剩余最多的节点上(Sort nodes by memory and tasks by memory requirements Rule: the node with the least memory requirement is allocated to the node with the most remaining memory)