资源列表
pre_PID_NUC
- 超短反馈控制算法-matlab程序 与PID比较-ultrashort feedback control algorithm-Matlab procedures compared with PID
TS_BPnet
- 使用模糊神经网络实现非线性函数映射，直接在matlab中运行即可。
string_match
- 串匹配算法,KMP,QS,Horspool,RP
Binary_tre1762296262004(1)
- 程序用于实现二叉树的建立及先序中序后序的遍历
mixture_gaussians
- 实现高斯背景建模，并且提取运动目标。具有良好的适用性-Gaussian background modeling to achieve, and extract the moving target. Good applicability
cordic
- cordic methods describe essentially the same algorithm that with suitably chosen inputs can be used to calculate a whole range of scientific functions including sin, cos, tan, arctan, arcsin, arccos, sinh, cosh, tanh, arctanh, log, exp, square root a
sanweilj
- 计算1000个氩原子，初始位型为面心立方格式，限制在一个立方体盒子中，采用的是LJ势，边界条件采用的弹性反射边界，差分格式采用速度形势的蛙跳格式 -Calculation of 1000 argon atoms, the initial position for the face-centered cubic-type format, limited to a cubic box, using the LJ potential, the flexibility of the use of b
dj
- 算法最短路径，利用迪杰斯特拉算法来设计求任意两点最短距离-Shortest path algorithm, Dijkstra algorithm is used to design the shortest distance between any two points demand
Huffman
- 自己写的有关数据结构哈夫曼树的程序，希望大家提出宝贵意见。-The relevant data structures to write their own programs Huffman tree, I hope your valuable advice.
student
- 基于C语言的 学生信息管理系统。有菜单、链表、功能界面、实现增删改查等。-C-based student information management system
Ant-Colony-Algorithm-matlab
- 利用蚁群算法寻找以下10个城市的TSP最短路径。输出最短路径顺序及其长度，以及蚁群算法迭代过程中的最短路径长度进化曲线-Ant colony algorithm to find the following 10 cities TSP shortest path. Output sequence and the shortest path length, and the ant colony algorithm is an iterative process of evolution of the
8puzzle_dfs
- 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。-翻译 实现了八数码问题，运用了图搜索中的DFS（深度优先搜索）。 The implementation of the eight digital issues, the use of the map search DFS (depth-first search).