C5.0决策树分类算法实现的C语言源代码！

K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K－均值聚类的的时间复杂度是n*k*m，其中n为样本数，k为类别数，m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类，寻找最优，列举一遍约66.7天，分成3类，则要约3500万年。针对算法局部最优的缺点，本人正在编制模拟退火程序进行改进。希望及早奉给大家，倾听高手教诲。-K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.

足球机器人避障算法，已通过实践证实可以用于足球比赛中，该源代码包含仿真界面，形象直观-Soccer robot obstacle avoidance algorithm has been proved through practice can be used for soccer matches, the source code contains the simulation interface, the image of intuitive

基于基本遗传算法的函数最优化，C++源代码-Price quilt hanging遗price for dialysis tub cavity算Finally, Yang Zhao ， Pro C++ Daitou Tungsten measurements

这是一个神经网络开发包。目录ann下是专门针对神经网络的代码，外部目录是一些公用的代码，与神经网络无关，但是神经网络的代码用到了它们。 ann目录下有一个目录demo，里面存放了一些示例程序，请参照它们进行编程。 ann/prj/vs7下是编译整个库的Visual Stdudio 2003工程文件-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. Ann/prj/vs7 under compiler for the entire 2003 Visual Stdudio engineering documents

用Prolog求解传教士和野人问题 复习经典谓词演算中的归结原理，掌握人工智能程序设计语言Prolog，理解通过搜索求解问题实现人工智能的思想。-Using Prolog to solve the issue of missionaries and Savage Classical Predicate Calculus review summarized in principle, grasp the artificial intelligence programming language Prolog, to understand to solve problems by searching for the realization of the idea of artificial intelligence.

MATLAB神经网络工具箱ＢＰ算法的比较，比较它们的训练时间长短以所达到的效果-MATLAB neural network toolbox BP algorithm compares the length of their training time in order to achieve the effect of the so

JESS开发模式，人工智能开发架构-JESS development model, the development of artificial intelligence structure

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

路由选择过程的c算法程序 与DSR 只是简单地使用最短路径不同，EMRPC 使用了更复杂的路由选择机制以实现多径路由和能量均衡。-process of routing algorithm c procedures and DSR is simply to use the shortest path different. EMRPC use of a more complex routing mechanisms to achieve multi-path routing and energy balance.

这是一个HOPFIELD神经网络程序，里面有MAKEFILE，方便读者运行-HOPFILED This is a neural network program, which has MAKEFILE easy operation