野人过河问题属于人工智能学科中的一个经典问题,问题描述如下: 有三个牧师(也有的翻译为传教士)和三个野人过河,只有一条能装下两个人的船,在河的任何一方或者船上,...

经典的K均值分类算法源码，修正了原作者没有处理当类中样本为0的情况下的bug-classic K-mean classification algorithm source code, that the original author did not address when the category 0 samples of the bug

LS-SVM_UserGuide是LS-SVM使用方法介绍的一篇文章，竟对我们学习支持向量机有很大的帮助。-LS-SVM_UserGuide is the use of LS-SVM method described in an article we had on the support vector machine learning of great help.

压缩包中的一系列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.

Kohonen网络的学习过程可描述为：对于每一个网络的输入，只调整一部分权值，使权向量更接近或更偏离输入矢量，这一调整过程就是竞争学习。随着不断的学习过程，所有输入矢量都在输入矢量空间相互分离，形成了各自代表输入空间的一类模式，这就是Kohonen网络的特征自动识别的聚类功能。请解压缩后按照readme提示进行操作。-Kohonen network learning process can be described as follows : for each one network input, only part of adjusting the weights, weight vector closer to or further from the input vector, the adjustment process is competitive learning. With the continuous process of learning, all the input vector in the importation of vector space separate form their own representatives importation of a type of space, and this is a Kohonen network of automatic clustering functions. Please decompress after readme according to instructions.

TSP问题是组合优化中的经典问题。其解决方法有局部优化方法和一些启发式算法,局部搜索方法充分考虑问题 的邻域结构,遗传算法有很好的全局搜索能力,memetic算法把遗传算法和局部优化算法相结合,试验结果证明,能很好地解 决TSP问题。-TSP problem is a classic combinatorial optimization problem. Its solution has a number of local optimization methods and heuristic algorithms, local search methods take full account of the issue of neighborhood structure, genetic algorithm has good ability of global search, memetic algorithm for the genetic algorithm and local optimization algorithm combining test results proved that well positioned to solve the TSP problem.

使用模拟退火思想解决图着色（GCP）问题，使用先看说明文件-??用??拟退 火??想 ???鐾 ??派???GCP ??问题 ????用先 ?

人工智能实验§贝叶斯网络的因果推理关系§ 熟悉掌握Bayes定理，学习贝叶斯网络的因果推理-artificial intelligence experiments Bayesian network causal reasoning relations mastery Bayes Theorem, learning Bayesian network causal reasoning

一个基于MFC的人工智能的巫魔问题求解，图形化界面显示。-an artificial intelligence-based MFC Witch of the devil problem solving, graphical interface shows.

Autolife模型是一个能够进行“开放式进化”的人工生命系统。每个Agent模型采用可以变化规则表长度的有限自动机模型建模。一方面Agent可以进行自我繁殖，同时模型中的选择机制没有采用显式的适应度函数而是采用能量消耗的简单模型而自发涌现出来，所以可以认为Agent模型是一个类Tierra系统。然而与Tierra、Avida等数字生命模型不同的是，Autolife模型进行了大大的简化，它界面友好，操作直接。虽然没有给每个Agent装配一个虚拟计算机，但是Agent与环境的耦合则可以看成一个图灵机模型，因此Agent可以通过变异而“任意”的编程序。通过Autolife模型，首先人们可以看到一般的生态系统中共存的现象：生物的大爆炸、大灭绝，Agent进化得越来越聪明；其次，用户可以通过变化不同的食物添加规则探索Agent与环境的关系；最后，如果允许Agent通过播种改变环境自动产生食物，那么组织的涌现就是一种不可避免的结果。Agent构成的组织具有自主运动的特性，还可以进行自我修复，可以说Autolife中的组织是一些真正的“活体”。-Autolife model is to conduct an "open-evolution" artificial life system. Each Agent can be used model changes the rules limited the length of the table automatic machine modeling. One Agent can be self-propagation, model selection mechanism not used Explicit the fitness function instead of using the energy consumption of a simple model to emerge spontaneously, so that the agent can be a model category Tierra system. But with Tierra, Avida digital life model is different Autolife model for greatly simplified its

用Delphi语言编写的遗传算法，内容较多，可以参考-Delphi language prepared by the genetic algorithm, a great deal of content, they can refer to