搜索资源列表
untitled
- 求任意一点到任意点的距离的最小值！ 对于求解一些最短距离的问题可以提供一些帮助！-seek any point to any point of the minimum distance! For some of the shortest distance to solve the problem, it can provide some help!
运筹学最小支撑树求解
- 运筹学最小支撑树的求解方法。该程序共有两种计算方法，可以用不同方法求解出最小支撑树。也可以对求解过程进行单步执行，从而清楚看出算法的求解过程。-tacticians minimum spanning tree method of solution. There are two procedures for the calculation method can use a different method to solve the smallest spanning tree. The solut
gradien_searching
- 在最优化问题中，常用需求取代价函数的最小值，该程序实现了最速梯度求最小的功能-in optimization problems, the demand to replace the commonly used function of the minimum price. the program achieved the steepest gradient for the smallest functional
chanshengsuijishu
- 随机产生8个100到300之间的数，并求其中的最小值。-randomly generated eight 100-300 between the few and for the minimum.
global_mini
- 寻找函数的全局极小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.-Find function of the minimum value of the overa
isogroup032
- 两个聚类中心之间的最小距离，如小于此数，两个聚类进行-two cluster centers between the minimum distance, as tens of thousands of small, two Clustering
BFGS_C++
- bfgs算法求全域最小数值点，c++源程序,文件读入套用方便-bfgs domain algorithm ambitious minimum values, c source, the document read into the convenient use
AssemblylineScheduling
- 使用动态规划方法解决多个生产线上的调度问题，进而解决生产线调度的最小时间问题-use dynamic programming solution to a number of production line scheduling problem, thereby solving production line scheduling the minimum time
guangjinfenge
- 黄金分割搜索法的vc代码，有两个过程实现，分别是Golden和mnbrak，mnbrak利用黄金比率和二次插值确定函数的极小值点的所在区间，Golden用黄金分割法求一元函数的极小值。-Golden Section Search vc law code, there are two processes to achieve, and Golden were mnbrak. mnbrak golden ratio and use quadratic interpolation function t
gaosifangfajisuanduochongjifen
- 1.功能 用高斯方法计算n重积分(C语言) 2.参数说明 int n : 积分重数 int js[n] : js[k]表示第k层积分区间所划分的子区间 void (*ss)() : 指向计算各层积分上、下限的函数名(用户自编) double (*f)() : 指向计算被积函数值的函数名(用户自编) double gaus() : 函数返回积分值 3.文件说明 gaus.c为函数程序 gaus0.c为主函数程序-1. Gaussian funct
zuiyouhua-chazhi
- 最优化方法-插值法求最小值 上最优化课程的时候写的程序-optimization-interpolation method for optimizing the most minimum of course written procedures
Douglas-PeuckerLineApproximationAlgorithm
- When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the
duoduantu
- 这是计算机算法基础中的动态规划的方法的一个例子，多段图是一个很经典的问题！这里的程序用于求解最小成本路径，用类似的思想可以解决最优分配方案的问题！-This is a computer algorithm based on the dynamic programming methods of an example, many of the map is a classic question! Here the procedures for calculating the minimum cost
基于网络最小割计算稠密深度图的全局优化方法
- 一种基于最小割的稠密视差图恢复算法 摘要:针对经典最小割算法计算量大和适应性不足的问题,提出一种改进的基于网络最小割计算稠密深度图的全局优化方法。,Based on the minimum cut of a dense disparity map algorithm to restore
DFT.rar
- 该程序包括了一个应用最为广的离散傅里叶变换，褶积，抽样最小相位。绝对能运行,The program includes an application of the most widely used discrete Fourier transform, convolution, sampling minimum phase. They can certainly run
MIN_CURVE_SURF.rar
- 最小曲率法的算法原理,以及算法例子. 有配图说明 最小曲率法是定向井、水平井轨道设计、测斜计算中经常使用的一种方法。在最小曲率法中，假设井段是空间斜平面上圆弧；对于滑动钻进方式，圆弧是非常合理的井眼轨迹曲线。,The MIN_CURVE_SURF function interpolates a regularly- or irregularly-gridded set of points, over either a plane or a sphere, with either a mini
Minimum-area-convex-polygon
- 凸多边形最小面积四边形包围盒算法，是计算最小面积最快的算法。-Minimum area convex polygon quadrilateral bounding box algorithm is the fastest algorithm to calculate the minimum area.
minimum-norm-Doppler-frequency
- 基于LPNM信道模型，通过最小范数求多径不相关信道的各径的各个载波的多普勒频率。-minimum norm multipath frequency by LPNM
Minimum-Set-Cover
- 最小集合覆盖的贪婪算法 C++ 运行速度很快-The minimum set cover greedy algorithm C++ run fast
Find minimum energy fcc configuration
- lammps源文件，可以实现计算面心立方晶格的最低能量(find minimum energy fcc configuration)