dksdkansdknaksdnkand

ACM一些题目，很有难度。能做出来的是高手。-ACM some questions, very difficult. Can come out is a master.

禁忌搜索（Tabu search）是局部邻域搜索算法的推广，Fred Glover在1986年提出这个概念，进而形成一套完整算法。 -Tabu search (Tabu search) is a local neighborhood search algorithm for the promotion, Fred Glover in 1986, proposed this idea, thus forming a complete set of algorithms.

% Function: [class,type]=dbscan(x,k,Eps) % ------------------------------------------------------------------------- % Aim: % Clustering the data with Density-Based Scan Algorithm with Noise (DBSCAN) % ------------------------------------------------------------------------- % Input: % x - data set (m,n); m-objects, n-variables % k - number of objects in a neighborhood of an object % (minimal number of objects considered as a cluster) % Eps - neighborhood radius, if not known avoid this parameter or put [] % ------------------------------------------------------------------------- % Output: % class - vector specifying assignment of the i-th object to certain % cluster (m,1) % type - vector specifying type of the i-th object % (core: 1, border: 0, outlier: -1)

这是有关Kalman矩阵计算的C源程序-This is the Kalman matrix calculation of C source

《科学工程计算C语言算法》一书代码。C语言编写。均写成函数形式，可以直接调用。包括数值微分、数值积分、插值、方程求解等数值算法。-"scientific engineering calculation algorithm C language," a code book. C language. Functions were written form can be called directly. Including numerical differentiation, numerical integration, interpolation, equation solving numerical algorithms.

带时间窗的车辆路径问题(Vehicle Routing Problem with Time Windows, VRPTW)是对物流配送管理的核心问题——配送车辆调度 的问题抽象,其是在基本VRP基础上添加了时间窗约束衍生而来的, 可以将VRPTW描述为:使车辆从站点出发服务用户,完成用户需求 后仍返回站点,规定每个用户只能被一辆车服务且仅服务一次,且对 用户的服务必须在用户事先指定的时间窗内进行,问题的优化目标是 如何选择适当的路径,使得在满足以上约束条件的情况下,完成全部 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

insertion_sort.cpp #include #include #include #define N 5000 int insertion_sort( int data_insert[] ); void creat_file( char *file_name, int data_file[] ); int main(int argc, char *argv[]){    int data[N];    creat_file( argv[1], data ); 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

高速公路客运仿真- Highway passenger transportation simulation

任意精度求pi,对内存基本没有要求，spigot算法-arbitrary precision for pi, no basic right memory requirements spigot Algorithm

资源描述stm32 MPU6050例子 陀螺仪进行姿态解算，涉及到信号采集，姿态解算。卡尔曼滤波等多种算法，，，