这是一个Prolog程序，是我的同学做的，对于学Prolog的朋友有些帮助，希望大家多多交流。...

bayes network 的分三角形的算法-bayes network breakdown triangle algorithm

bayes network classifier toolbox 贝叶斯网络分类工具箱-bayes network toolbox Bayesian classifier network classifier Toolbox

Matlab中的GA程序-Matlab GA procedures

1、编制程序显示印章图像（24位真彩色位图）； 2、读出位图中每一像素点的（R，G，B）样本值； 3、以RGB其中某两个（或三个）为坐标，取一定数量的图像点为分析样本，分析其坐标系中的分布； 4、采用本章学习的方法找到分类判别函数，对这些样本进行分类；（要求首先将印章与底纹区分，如有可能将印章、底纹、签字区分） 5、将分类后的结果标记到原始图像上，检查其效果。 -1, the preparation procedures showed that the seal image (24-bit true color bitmap) 2, read out each bitmap pixel (R, G, B) sample value 3 to RGB which a two (or three ) for the coordinates, take a certain number of image points for the analysis of samples, analysis of its coordinate system of distribution 4, the method used in this chapter to learn to find discriminant function classification of these samples for classification (required first to distinguish between the seal and Shading, if possible, will seal, Shading, signatures to distinguish between) 5, will be the result of classification markings to the original image to check its effectiveness.

fortran 语 言 编 写 基 本 遗 传 算 法 源 程 序 fortran Genetic Algorithms written by FORTRAN

Hopfield Model神经网络-Hopfield neural network

用遗传算法求解TSP问题。。。matlab编写，并附带有城市坐标用于检验。-Genetic Algorithm for TSP with the problem. . . matlab prepared, together with the coordinates with the city for inspection.

一组老外编写的神经网络源代码，非常值得收藏和研究。有BPN、ART1、ADALINE、SOM、CPN、HOPFIELD、BOLTZMAN等神经网络。吐血推荐在进行神经网络编程的朋友下载。 -a group of foreigners prepared neural network source code is very worthwhile collection and research. There are 7.82, ART1, ADALINE, SOM, CPN, Hopfield, BOLTZMAN such as neural networks. Suggest to vomit blood during neural network programming downloaded friends.

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

野人过河问题属于人工智能学科中的一个经典问题,问题描述如下: 有三个牧师(也有的翻译为传教士)和三个野人过河,只有一条能装下两个人的船,在河的任何一方或者船上,如果野人的人数大于牧师的人数,那么牧师就会有危险. -Savage disciplines of artificial intelligence problems are across the river a classic problem, described as follows: there are three priests (and some translation for the missionaries) and three wild man to cross the river, there is only one person can hold two boats, the river of any either on board or, if greater than the number of wild man of the number of priests, then the pastor will be in danger.