资源列表
PatternRecognition
- 模式识别配套电子书，可作为模式识别初学者的参考资料，希望对学习有所帮助。-Supporting electronic pattern recognition, pattern recognition can be used as reference for beginners, and they hope to be helpful to learn.
ant
- 人工智能 人工蚂蚁程序 刺激响应Agent 蚂蚁会朝着信息素方向移动-Artificial intelligence program to stimulate the response of artificial ants ants Agent will be moving towards the pheromone
20080912103856
- 人工智能 十五数码和八数码问题 包含界面-Artificial Intelligence 15 digital and eight issues included in the digital interface
Softman(2007)
- 人工智能泰斗涂序彦在西安交通大学的演讲！-Presentation of Tu Xu Yan about AI!
SchedulingSystem
- 可用于大学的遗传算法实现排课系统！用遗传算法能达到最好的效果-Can be used for the genetic algorithm University Course Scheduling System! Using genetic algorithms to achieve their best effect
GeneticAlgorithmLibrarywithJavaGUI
- The Genetic Algorithm Library is used for function optimization i.e.to find minimum or maximum value of a function.
GEneticalgorithmforNumericalOptimizationforCOnstr
- GENOCOP (GEnetic algorithm for Numerical Optimization for COnstrained Problems). This system is optimizing any function with any number of linear constraints (equalities and inequalities).
AdvancedGeneticAlgorithm
- This code and accompanying explanation is designed to be a genetic algorithm. It uses the roulette wheel method to optimize the function x^2 using six digit binary strings. The accompanying document goes through the algorithm and the code step-by-ste
Carfire
- 灭火机器人比赛要求 ①在迷宫中找到火源：必须确认进入火焰圆弧的30cm区域，而不能是碰巧经过火焰区域。 ②做出灭火动作：必须在进入火焰区域后方有效，可以是风扇转动，喷出灭火物质等。 ③将火扑灭：保证完成前两项动作基础上，将火扑灭。而不能是碰倒蜡烛使之熄灭，或碰巧喷出灭火物质。 ④灭火时间：在完成灭火任务的同时计算每组的灭火时间，时间最短者获胜。 -Requirements of fire fighting robot competition ① in the maze to
recursiveDPKnapsack
- 用vc++6编写的程序，采用动态规划递归算法，解决背包问题。-Vc++6 with the preparation of the procedures, the use of dynamic programming recursive algorithm to solve knapsack problem.
Navigation
- 机器人全方位摄像机导航。捕获红色信息，并输出旋转角度和方向-Omnidirectional camera robot navigation. Red information capture and output and direction of rotation
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.