佐治亚理工学院的人工智能平台。由Java编写。仅供学习人工智能的网友学习。...

这是用prolog写的几个程序：程序１是一个旅行社关系系统，程序２是一个家族关系系统，程序３是一个成绩管理系统-This is prolog written several programs : a procedure is a travel agency relations systems, procedures 2 is a family relationship systems, procedures 3 is a performance management system

利用 免疫算法求解TSP问题 可以精确求出50个城市-Using immune algorithm for solving TSP problems can be accurately calculated 50 cities

国外的一个A*算法演示，带源代码。作为算法参考非常好-abroad an A* algorithm demonstration, with the source code. As a very good reference algorithm

压缩包中的一系列matlab程序实现了“特定人群语音情感识别”这一新颖的研究课题。具体介绍请见压缩包中的论文。-compressed in a series of Matlab program of "specific emotional crowd voice recognition" of the new study. Specific details of compressed see the papers.

这是蚁群算法的一个模拟的软件,可以看到整个蚁群觅食的具体过程,对算法的理解很有帮助.-This is the ant colony algorithm, a simulation software, can see the whole ant colony foraging specific process, the understanding of the algorithm very helpful.

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为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 ...

一种运算效率较高的遗传算法-a higher genetic algorithms

ClustanGraphics聚类分析工具。提供了11种聚类算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of Squares Flexible (ß space distortion parameter) Density (or k-linkage, density-seeking mode analysis) -ClustanGraphics clustering analysis tools. Provides 11 kinds of clustering algorithms. Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean ProximityCentroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of SquaresFlexible (? space distortion parameter) Density (or k-linkage, density-seeking mode analysis)

这是一个神经网络开发包。目录ann下是专门针对神经网络的代码，外部目录是一些公用的代码，与神经网络无关，但是神经网络的代码用到了它们。 ann目录下有一个目录demo，里面存放了一些示例程序，请参照它们进行编程。-This a neural network development kit. Ann directory under specific neural network code, external directory is some common code, has nothing to do with the neural network, but neural networks use of their code. Ann directory is a directory demo, stored inside a sample program, please refer to their program.

Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg -Pascal Programs Printed in GENETIC ALGORITHMS IN SEARCH, OPTIMIZATION, AND MACHINE LEARNING by David E. Goldberg