资源列表
anttsp
- ACSmatlabCode蚁群算法解TSP问题的源代码，希望对学习蚂蚁算法的朋友提供帮助-ant tsp problem
knapsackproblems
- 本程序用MFC实现了背包问题中贪婪法，动态规划法，蛮力法，分支界限法的可视化-This procedure using MFC in a knapsack problem greedy method, dynamic programming method, brute force method, branch visualization limits of the law
1
- 先序输入数据，然后按从大到小进行快速排序-First input data sequence, and then quickly sorted by smallest
mpi_kmeans
- MPI implementatiobn of k-means clustering
BPnet(vb)
- VB 实现的BP网络，比较简单，适合于初学者-VB of the BP network to achieve
K-MEANS
- VC 实现的k均值聚类的代码，代码和功能都很简单，适合初学者-VC to achieve k-means clustering of the code, code and functionality are very simple, suitable for beginners
Eulerformula
- 欧拉公式的C语言实现 -Euler formula
ARMA
- ARMA 过程编程实现，不是很难，可以实现一步预测。-ARMA process of programming is not difficult, step in the forecast can be achieved.
C_Code-for-ACO
- 基本蚁群算法的C代码，是学习蚁群优化理论的不可或缺的资料。-The basic ant colony algorithm of C code, ant colony optimization theory is the study of essential information.
BinPacking
- 十一个不同的算法解决一个NP-Hard问题。 包括遗传算法GA, 爬山算法HC。 名称：K背包问题-10 Pop,Single Ally-Gene Mutation EA 10 Pop,2 Ally-Gene Mutation EA 10 Pop,10 Ally-Gene Mutation EA 10 Pop,20 Ally-Gene Mutation 10 Pop,100 Ally-Gene Mutation 100 Pop,Single Ally-Ge
zhuigan
- 本程序为追赶法 求解三对角线方程 追赶法求解三对角矩阵是数值算法中重要的一种-This procedure for the method to catch up with catch up with tridiagonal equation method tridiagonal matrix is an important numerical algorithm of a
ntchazhi
- 利用插值基函数很容易得到拉格朗日插值多项式，公式结构紧凑，在理论分析中甚为方便，但当插值节点增减时全部插值基函数lk(x)(k=0,1,…,n)均要随之变化，整个公式也将发生变化， 这在实际计算中是很不方便的，为了克服这一缺点，提出了牛顿插值。 -The use of interpolation basis function can easily obtain the Lagrange interpolation polynomial, the formula is compact and