资源列表
beibao
- 用动态规划的方法解0/1背包问题。用VC6编译运行正确。供参考-Using dynamic programming for solving 0/1 knapsack problem. Compile and run correctly with VC6. Reference
Apriori
- 该算法应用于单维、单层、布尔关联规则，其核心是基于两阶段频集思想的递推算法。首先找出所有的频集，这些项集出现的频繁性至少和预定义的最小支持度一样。然后由频集产生强关联规则，这些规则必须满足最小支持度和最小可信度。-The algorithm is applied to one-dimensional, single-layer, Boolean association rules, its core is based on the idea of a two-stag
DIT_base0n2_FFT
- 时间抽取(DIT)基2FFT算法: 输入:先输入数组长度(8,16,32...),再输入数组内容. 输出:FFT变换结果.
SPLINE
- 我自己写的一个三次样条插值算法，自已感觉很严密，请大家指正。-I wrote it myself a cubic spline interpolation algorithm, self-feelings are very close, please correct me.
mat_multi
- A program to find the best order to be considered for multiplying matrices so that we can reduce the number of multiplication operation as it is a costly operation.It includes a source code (.c), input file(.txt) and the output file.-A program to fin
qiege_new
- //多边形切割 //可用于半平面交 //将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-/ / polygon cutting / / can be used for half-plane AC / / will polygon along l1, l2 determined by the straight line cutting in the side cutting side, ensuring l1, l2, side not collinea
qie_ge_new
- 将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-will polygon along l1, l2 cutting straight to determine the lateral side of the cutting, guaranteed l1, l2, side is not collinear
bag
- 在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高，即p1*x1+p2*x1+...+pi*xi(其1<=i<=n，x取0或1，取1表示选取物品i) 取得最大值。
经典矩形问题
- 经典矩形问题 生成各种矩阵是竞赛时经常考的一种题目,如何用C语言或C++生成以下形式几种矩阵:-classic rectangular matrix of various problems generated when the contest is a regular test subject, how to use C or C generated several matrix form :
isqrt
- 32位无符号整数开方得到16位无符号整数的算法及实现代码-32-bit unsigned integer prescr iption 16 bit unsigned integer code of the algorithm and the realization of A algorithm an emplimentation codes of computing the 16-bits square root result from a 32-bits unsigned integer
lingozuiduan
- Lingo求解最短路问题的很好的例子，带有例题详细说明，是最短路问题求解的通用程序！-Solving the shortest path problem Lingo good example, with detailed examples, is the most common procedures for solving shortest path problem!
test
- 这个汉诺塔 问题 汉诺塔 问题 测试-this is a test program