the program for the establishment of a functional classification, which is used...

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

knn，即k最近邻算法是模式识别中的一种比较简单而经典的分类算法-Knn, or k-nearest neighbor algrithom, is a simple and classical classifier algrithom.

此为蚂蚁算法求解TSP的源代码，希望对大家有所帮助-This is the ant algorithm to solve TSP source code, and they hope to help everyone

Counterpropagation Network Vision 源码, 经典的CPN人工神经网络例子源码-Counterpropagation Network Vision source, CPN classic example ANN FOSS

车辆识别-vehicle identification

标准微粒群算法源程序,该程序用于计算Goldstein-Price函数的函数最小值-Standard Particle Swarm Optimization source, the program used to calculate the Goldstein-Price function function of the minimum

目前最好的A*寻路算法-Currently the best A* pathfinding algorithm. . . . . . . . .

本人编写的GramSchmidt神经网络算法，和传统的神经网络算法比较，该算法能自动产生神经元，节约时间，速度快！ 本人还加了自动产生分类的方法和适合各种函数的转换，该zip包括两个文件，一个是GramSchmidt正交分解，是个子函数，主函数是orth_GramSchmidt，放在同一目录下，就可运行，可以对benchmark的逼近和分类问题提供解决方案-I prepared GramSchmidt neural network algorithm, and the traditional neural network algorithm, the algorithm can automatically generate neurons, saving time, fast! I also added a method of automatically generated classification and conversion for a variety of functions, the zip includes two documents, one is GramSchmidt orthogonal decomposition is a sub-function, the main function is orth_GramSchmidt, on the same directory, you can run can benchmark approximation and classification problems to provide solutions

这是用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