资源列表
Hanoi_NonRescursive
- 利用堆栈的原理来实现汉诺塔程序的模拟递归
RSmatlab
- R/S分析法计算logRS值, 然后通过最小二乘法回归即可得到hurst参数的估计值.-R/S analysis method logRS value, and then return can be obtained through the least square method hurst parameter estimate.
1132813581
- 算法导论书上的动态规划---编辑距离的实现-algorithm==== edit distance
SVM_CV
- SVM+交叉验证，使用libsvm工具箱(程序内不附带)-SVM+CV，use libsvm
MiGongzhan
- 用栈实现迷宫，C语言操作，绝对可以运行，帮助了解栈的应用-Stack to achieve the maze, the operation of the C language, can definitely run, to help understand the application of the stack
avl
- 实现了AVL树的查找，删除，四种旋转。可以直接运行-Realized AVL tree search, delete, four kinds of rotation. Can be run directly
Particle-Swarm-Optimization
- 用基于交叉遗传的粒子群优化算法求解无约束优化问题；用基于模拟退火的粒子群优化算法求解无约束优化问题-Based on the cross with a genetic particle swarm optimization algorithm for solving unconstrained optimization problems using simulated annealing particle swarm optimization algorithm for solving unc
FCTVOFMain
- FCTVOF的主程序,其中FCTVOF是求解关于VOF值的运输方程的一种经典算法，可求出各时刻的各网格的VOF值，从而利用界面重构技术实现界面的重构。-FCTVOF main program, including FCTVOF is for solving the transport equation of VOF value a classic algorithm, can calculate the VOF value of each moment of each grid, so as t
infix
- c语言 中缀、后缀 算术表达式求值用栈实现-c language, infix, postfix arithmetic expression evaluates to achieve with Stack
GA
- Very Simple Genetic Algorithm
Binary-Tree
- （1）实现二叉树的构造过程，并打印出二叉树 （2）对该二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历； （3）将该二叉树的所有左右子树进行交换，得到新的二叉树，并打印出该二叉树； （4）对新获得的二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历。-(1) the construction process to achieve the two fork tree, and print out the two fork tree
T-S-mohumoxing
- 这里是基于T-S(Sugeno)模型的倒立摆模糊控制程序。可以运行。-Here are handstand based on TS (Sugeno) model of the pendulum fuzzy control procedures. You can run.