Genetic Algorithms in Artificial Intelligence the authority of books suitable fo...

〈智能优化算法与应用〉介绍各种优化算法：模拟褪火法、遗传算法、禁忌搜索法、神经网络法、混合优化策略等内容。-"intelligent optimization algorithms and application" on the various optimization algorithms : simulated fire faded, genetic algorithm, Tabu search method, neural networks, hybrid optimization strategy content.

人工神经网络天气预报方法-ANN weather forecasting method

蚁群算法,蚁群算法原理及其应用中的源代码-Ant algorithm, ant colony algorithm and its application in source code

Basic library that implements Kohonen s SOM and its learning. Lanuage: C# (.Net 3.5 Framework)

一种智能语言，适合用来做专家系统 an artificial intelligence language named clips, it is useful in ES engineer-An intelligent language, suitable for expert system used an artificial intelligence language named clips, it is useful in ES engineer

麻省理工开发的免费遗传算法类库GAlib,很好用，我用它实现过一些具体问题的遗传算法。- Hemp province technical development free heredity algorithm class storehouse GAlib, is very easy to use, I use it to realize some concrete questions heredity algorithms.

每条人工鱼迭代20次的位置,每条人工鱼迭代20次的位置,对应的Y的值,每条人工鱼迭代20次的临时位置,公告牌,每条人工鱼迭代20次的位置,对应的Y的临时值，公告牌,人工鱼移动的最大步长,求出最优的函数值；-Each of artificial fish, the location of 20 iterations, each iteration of artificial fish, the location of 20 times the corresponding value of Y, each iteration of artificial fish 20 times a temporary location, bulletin boards, each iteration of artificial fish 20 second position, corresponding to the provisional value of Y, bulletin boards, artificial fish, the biggest step to move, find the optimal function value

ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing

数据挖掘中很不错的源码,一个share算法的java源程序,有极好的可读性-data mining is a good source, a share algorithm java source files, has an excellent readability

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...