资源列表
ND
- 用两个一维数组对牛顿插值的C语言程序进行改进（在原程序中减少一个一维数组）-using a two-dimensional array of Newton interpolation procedures for the C language improvements (in the original process to reduce a one-dimensional arrays)
05062129
- 蚀膨胀细化算法源代码 用C++BUILDE写的-corrosion expansion thinning algorithm using source code written in C BUILDE
Go5
- VC++.NET2003下编写的人机对战的五子棋程序，具有一定的人工智能。-VC.NET2003 prepared with the plane's 331 players procedures and to a certain extent artificial intelligence.
Branchboundalgorithmtosolvthetravellingsalesmanpro
- 货郎担限界算法.c，货郎担分枝限界图形演示.c-traveling salesman Bound algorithm. C, traveling salesman Branch and Bound graphic demonstration. C
radarchengxiang
- 一种基于匹配滤波的对地面目标成像的算法 属于雷达成像部分的内容-a matched filter based on the targets on the ground imaging radar imaging algorithm is part of the contents
zhipaiwenti
- 运筹学之指派问题的匈牙利算法。刚刚才看到的，不错哦-tacticians Zhi assignment of the Hungarian algorithm. Only just to see, oh well
比较大的数的阶乘
- 可能很多人都曾经想过要实现一些比较大的数的阶乘，但是C++中提供的标准数据类型其存储空间太小，根本无法实现。我们可以通过其他方法来实现-many people may have thought about the need to achieve some fairly large number of factorial. But C is the standard data types storage space is too small, it is virtually impossible
16428
- 学习matlab的朋友，这是一个计算线性方程组的程序，略有改进，若有疑问不吝赐教-learning Matlab friends, which is a calculation of linear equations procedures, a slight improvement If in doubt wing
20060412145418318
- SOC验证的程序 有用 说明不多自己看吧-SOC certification procedures useful little note ion battery
subsetcalculator
- 本算法实现2-10集合划分问题,采用动态规划法和大整数方法-the algorithm 2-10 set partition, using dynamic programming methods and the Integer
ntree
- 设T 是一棵带权树，树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ，则称T/S 是一个d 森林。 (1)设计一个算法求T的最小顶点集S，使T/S是d 森林。(提示：从叶向根移动) (2)分析算法的正确性和计算复杂性。 (3)设T中有n 个顶点，则算法的计算时间复杂性应为O(n)。-based T is a right to bring a tree for every one o
2SAT
- 对于给定的2-CNF，设计一个线性时间算法，判定其是否可满足。-given for the 2-CNF, design a linear-time algorithm that can determine whether they meet.