示范代码平衡二叉树的实现，并使用了…

　本程序是在原来的单纯形法基础上改进的,主要用于分枝界定法求解的整数规划。 　修正的地方： 　　１．运用勃兰特原则 　　２.人机互动-this procedure is in the original simplex method on the basis of improvement, mainly for Mycobacterium defined method of integer programming. The amendment : 1. Using the principle of two Brandt. Human-Computer Interaction

雅克比算法，计算结构自振特征的基本方法，可求解结构的所有阶次振型和自振频率-Jacques algorithm to calculate structural vibration characteristics of the basic methods can solve all the structural order of vibration and vibration frequency

逐次超松驰迭代法(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.

应用背景ｖｉｓｕａｌＣ＋＋制作汉子的逐个显示动画，输出“你好！欢迎你来到山西大同大学！！！”关键技术ＣＤＣ类的应用，ｖｉｓｕａｌＣ＋＋编程

数值计算算法：夹紧三次样条算法的数学写帕斯卡尔 来构造三次样条插值S为函数f，   在数x（0）

资源描述工资管理系统，C语言作业，简单，易用

C4.5的简化版本是一个决策树的算法-C4.5 is a simplified version of the Decision Tree Algorithm

由给出的三个点坐标，拟合出一条样条曲线，对于工程或数据分析的同志有作用。-Three points by the given coordinates, fitting out of a spline curve, or data analysis for the project has the role of comrades.

基本粒子群算法的matlab源程序，求解优化问题

*   To find a solution to the equation f(x) = 0*   given initial approximations p0 and p1:**   INPUT:   initial approximation p0, p1; tolerance TOL;*            maximum number of iterations N0.**   OUTPUT:  approximate solution p or*            a message that the algorithm fails.*