人工智能学习指导

《游戏编程中的人工智能技术》一书中4，5章源代码- Game programming in artificial intelligence technology, one source book, Chapter 4,5

一个牛人的神经网络支持向量机代码,对于搞模式识别的朋友强烈推荐!-A wonderful program of svm code coming from a superman,and strong recommendation to someone who learn about pattern-recognition .

本算法为自适应遗传算法，采用基于排序的选择策略，编码方案为实数编码。能够解决很多优化问题！-The algorithm for the adaptive genetic algorithm, based on the sort of choice strategy, coding schemes for real-coded. Many optimization problems can be solved!

为模型参数中的动静比例知道的情况 属于一种新的模型 - The situation knew which for the model parameter in sound of something astir proportion belongs to one kind of new model

一个改进的聚类算法FCMA,可以实现数据的自适应有效聚类,对2维数据测试效果较好- An improvement gathers kind of algorithm FCMA, may auto-adapted realize the data effectively to gather the kind, is better to 2 dimensions according to the test effect

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.

这是类似winzip压缩软件的一个源代码，希望大家喜欢-This is similar to winzip compression software, a source code, I hope you like

这是一个用matlab编制的DE算法的源程序，希望大家喜欢！-This is a preparation using the Matlab DE algorithm source, hope you like them!

实现模糊控制算法(AD DA)和人机接口（4x4键盘 2x16LCD 串口1/2）

已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi"an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find the shortest path. 2) find Beijing to Kunming, Shanghai must channel"s path. 3) to find Beijing to Kunming, Shanghai must channels, but can not go to Guangzhou"s path.