资源列表
shenjingnet
- 这是有关计算机人工智能方面的资料，主要针对神经网络
Based_on_genetic_algorithm_for_solving_the_shortes
- 基于遗传算法的最短路径问题求解Based_on_genetic_algorithm_for_solving_the_shortest_path_problem-Based_on_genetic_algorithm_for_solving_the_shortest_path_problem
5v5rule
- 关于机器人仿真足球的算法介绍，机器人仿真这几年在全国和世界范围内一直受到很多人的追捧。-On the robot soccer simulation algorithm, the robot simulation over the past few years in the country and around the world has been sought after by many people.
DataFitter.tar
- 使用多项式进行数据拟合。手动选择多项式项数。 注意，项越多拟合越精确，但却会产生更复杂的结果，导致不能有效预测未来的数据（机器学习的内容）-Data using polynomial fitting. Manually select the number of polynomial terms. Note that the more fit the more precise term, but will produce more complex results, leading to the
BP
- 人工神经网络中著名的BP算法的实现，在VC下可以直接运行-Artificial Neural Networks in the well-known BP algorithm, the VC can be directly run
yuce
- 一个预测算法，对采集的数据点进行拟合预测，得到最佳曲线。-A prediction algorithm, the collected data points were fitted predict the best curve.
rbf
- 介绍径向基函数及其人工神经网络，并且实例应用-Introduced radial basis function and artificial neural networks and application
NLCzuoye
- 本人非线性控制理论的大作业,绝对经典,完全可以运行,全力打造,真心奉献,希望会对正在学习的朋友有所帮助!
3-6
- 使用f[i][j]代表从i到j所花费最小费用，则将从i到j路径变成i->z->j，k代表要走的站点数量，起始位置为i所以终点位置为：i+k，保证最后一段为k所以循环截止到i<=n-k，z就是中间站点。如果这样比f[i][j]小，则交换值(Using f[i][j] to represent the minimum cost from I to j will turn I from J to i->z->j, K represents the number of si
code
- Q-learning 算法实现AGV的最优路径规划，实测效果非常好，对于研究深度学习和强化学习的同学很有帮助！(The Q-learning algorithm realizes the optimal path planning of AGV, and the measured results are very good. It is very helpful for students who are studying deep learning and reinforcement learn
Harris
- 这是Harris角点检测算法的优化研究，有很*价值！-Harris corner detection algorithm optimization of great reference value!
mo_ni_tui_huo_algorithm
- 模拟退火算法的编程实现，在VC++下，调试比较方便，供本科一年级使用-Simulated annealing algorithm programmed in VC++, the debugging more convenient for the use of undergraduate students