资源列表
Speaker-recognition-based-on-GMM
- 本代码是主要实现基于GMM算法的说话人识别功能，属于现在比较热门的人工智能领域。-The code is mainly to achieve Based on GMM speaker recognition algorithms, it is now more popular field of artificial intelligence.
recommendation-system
- 一个08基于信任的推荐系统的模型 -A model of a 08trust-based recommendation systemA model of a 08trust-based recommendation system
BP-C
- : 针对常规 PID 控制器不能在线修正参数以及模糊规则和率属函数对专家经验的依赖 性，提出了神经网络模糊自适应 PID 控制器，-Research on Fuzzy Adaptive PID Control Based on Neural Netowork
matlab-neural-network-teaching-book
- MATLAB神经网络应用设计（书及代码),对初学者是很好的学习资料-MATLAB neural network application design (and the code book), for beginners is a good learning materials
mapso
- 基于mapso的鲁棒PID控制算法，针对控制系统的PID优化- Optimal PID Controller Based on Multi-Agent Particle Swarm Optimization Algorithm
RandWPSO
- 对粒子群算法的改进，利用一类名为随机权重法来更新粒子的速度和位置，用来解决静态单目标优化问题-It is the improved particle swarm optimization algorithm. It introduced a kind method named random weight to update the position and velocity of the particle. It can be used for handle single objective p
SAPSO
- 对粒子群算法的改进，利用一种名为自适应权重粒子的方法来更新粒子速度和位置，用来解决静态单目标优化问题-It is the improved particle swarm optimization algorithm. It introduced a kind method named adaptive weight to update the position and velocity of the particle. It can be used for handling single obj
LinWPSO
- 对典型的粒子群算法的改进，是一类权重改进的粒子群算法，利用新型递减权重法来更新粒子速度和位置，用来解决静态单目标优化问题-It is the improved particle swarm optimization algorithm. It introduced a kind method named new decreasing weight to update the position and velocity of the particle. It can be used for han
SIMPLE-and-ATTEPPT-comparison
- 这个源码是SIMPLE Routing Protocol for Wireless Body Area Networks 这篇文章的仿真源码-This source code is SIMPLE Routing Protocol for Wireless Body Area Networks simulation the source code for this article
hand_writing
- 用Java实现了手写体数字识别，采用了WEKA工具包-Using Java to achieve a handwritten digit recognition, using the WEKA Toolkit
test
- C++实现高斯分解，详细列出了具体的过程- C++ Gauss decomposition
test
- 用C++实现了如何用遗传算法解决TSP旅行商问题-C++ realized how to use genetic algorithms to solve the traveling salesman problem TSP