资源列表
kingder
- 基于DRNN的神经网络整定参数自学习的PID控制仿真-DRNN based on neural network tuning parameters since learning PID Control Simulation
zui_xiao_er_cheng_fa
- 最小二乘法一般是用来拟合直线和一些线性数据的，就是用一条直线来尽可能的表达若干的点的趋势，当然直线穿过所有的点是最好的，但往往有误差存在，所以拟合出的直线要求误差最小.设这些点为(x1,y1),(x2,y2)....(xn,yn).拟合直线为y=kx+b.-Ordinary least squares method is used to fit a straight line and a number of linear data, that is, as far as possible wit
6.7.1
- 图的深度和广度优先搜索 1.图采用邻接表的存储结构 2.深度优先搜索图 3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
semnt
- segmentation based on intensity
bianli
- 图的遍历，对有向图进行广度和深度优先遍历。-Graph traversal, directed graph on the breadth and depth-first traversal.
Maze(Stack)
- 应用栈求迷宫通路，用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直至探索到通路为止。-Application stack requirements maze path, using a "brute-force solving" approach, starting from the entrance, along a forward direction to explore, if we go through, the
sort
- 两种排序算法实现，随机快拍和和并排序，随机快拍为生成随机数key-Two sorting algorithms, random snapshots and and and sort
tree
- 数据结构中二叉排序树的遍历插入删除,能够在C/C++的环境下运行。-Data structure traversal of the binary sort tree insertion deletion, can C/C++ environment to run.
shuangxiangbianli
- 实现双向链表建立，删除，插入，遍历，判断对称性，排列链表功能-Doubly linked list to create, delete, insert, traversal to determine the symmetry and arrangement of linked list functions
MOG
- 利用opencv工具包实现混合高斯背景建模，可完成实时的背景抓取-Opencv toolkits use Gaussian mixture background modeling, to be completed in real-time background crawl
3SAT(SA)
- 使用模拟退火算法（SA）解决3-SAT问题，程序中有详细注释，采用文件方式输入输出，数据规模可在程序中修改。-Using simulated annealing algorithm (SA) to solve the 3-SAT problem, the program has detailed notes, the use of input and output files, data scale can be modified in the program.
806261
- 这是一个用VB实现的文件输出程序,不错的源码-This is a VB output program implementation of file, good source