神经网络的手写识别

应用背景旅游销售人员问题（旅行商）；可以用最小生成树来解决（MST）的启发，估计 ；一个旅游的费用，因为有部分旅游已经构建。MST  ；一套城市的成本是最小的总和连接所有和所有的树的链接成本；城市；关键技术旅游营业员问题和问题，一个小的，形状记忆合金，一个* &；

资源描述该代码里包含里两种使用c求逆矩阵的代码，一种是使用伴随矩阵除以行列式得到逆矩阵，另一种是使用高斯消元法求逆矩阵

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

一个简单的算法,本源代码给出了16只队伍,进行双循环的赛程编排-a simple algorithm, the source code is 16 teams, double-scheduling cycle race

该工具箱包括了典型地贝叶斯网络学习方法，并且通过实例比较了这些方法的性能，同时还比较了这些方法用于贝叶斯分类中的准确率                                  

这是一个用MATLAB写的免疫算法程序。-This is a MATLAB program written by Immune Algorithm.

This program implements various interpolation techniques to resize 2D matrices or Image Matrices. Methods of interpolation used are 1) Nearest Neighbour 2) Bilinear 3) Bicubic 2x2 4) Bicubic 4x4 5) Bicubic 6x6 6) Bicubic 8x8

有用的光盘工具安装向导软件-useful tool installation wizard CD-ROM software

最优化课程中要用到的所有最优化算法，全都经过验证-Optimization of the curriculum used in all optimization algorithms, all verified

四次及四次以下多项式拟和程序,可在c或c++环境下运行-Polynomial fit arithmetic witch could been run in C or C++ environment