资源列表
wash
- VHDL语言开发的全自动洗衣机的源程序 可以通过一个按键的复用实现5种功能的选择-VHDL development of the automatic washing machine of the source can be a button to achieve five multiplexing functions choice
d_0609030843321
- 用有限状态机实现的走迷宫演示程序，用到了opengl，可以当作DEMO来用-finite state machine to achieve the Maze demo program, used the opengl, to be used as DEMO
graphyimaseg
- 基于图匹配理论的图像分割，是IJCV上那片经典文献的作者写的程序，简练实用。可以给做这方面的人的参考-based on the theory of graph matching image segmentation, Shangri-La is IJCV on classic literature written by the author of procedures, concise practical. This can be done to the people of reference
Rosenstein_lyapunov_c
- Hopfield神经网络算法源程序：这程序是《神经网络模式识别及其实现》第九章<神经联想记忆和Hopfield网络>附的程序，用于神经网络的实现-Hopfield neural network algorithm source : This procedure is "pattern recognition and neural network to achieve" the ninth chapter
rangedataread
- 点云预处理时，需要将.abs压缩格式转化为.asc格式，同时需要得到深度图像。本程序完成这一功能。这可是一般都不会拿出来的。-point cloud, it needs to be. Abs into compressed format. Asc format, also need to be depth images. The procedures are completed this function. But it will not usually take to work.
anglcau
- 在点云处理中，我们通常需要知道两个面的夹角，这个小程序通过最小二乘拟合。求的两个面的夹角，供参考。-in point cloud processing, we often need to know the angle between two faces, the small least-squares fitting procedure. For the angle between the two face for reference.
基本遗传算法
- 基本遗传算法-basic genetic algorithm
AntsPath
- 蚂蚁算法的java实现,主要在选择路径的迭代上做了改进，欢迎下载！-ant algorithm to achieve the java, mainly in the choice of the path iterative improvements made welcome download!
NeuralRBF
- 神经网络RBF网络预测和分类，很实用的程序-neural network RBF network prediction and classification of very practical procedures
CashM_src
- hao code hao code hao code-hao code hao code hao codeh ao codeh ao codehao code
kalman1
- kalman滤波的仿真 kalman滤波的仿真-Kalman Filter Simulation Kalman Filter Simulation kal man Kalman Filter Simulation Filter Simulation
TSPproblem
- 遗传算法解决TSP问题 已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each city can only be visited once, La