本程序利用蚂蚁算法解决TSP（旅行商问题）问题

神经网络仿真工具，本程序是BP算法的演示程序, 其中的Levenberg-Marquardt算法具有实用价值.-Neural network simulation tool, this program is BP algorithm demo program in which the Levenberg-Marquardt algorithm has practical value.

此代码是用c语言编写的决策树的c4.5代码，它是数据挖掘分类算法中的一种，可以对给定数据集进行分类，挖掘出规则-this code is c language of the decision tree Bank code, which is data mining classification algorithm of a can of a given data set for classification, tapping rules

水平有限，仅供参考！望大家多提宝贵意见！-limited, and for reference purposes only! Hope you will provide more valuable opinions!

8皇后问题。所谓著名的八皇后问题就是八个皇后在8*8的网格中排列时不能同在一行、一列或者一条斜线上。根据前人的研究，在8！=40320种排列中只有92中解决方案。-8 Queen

基于k均值聚类学习算法的rbf神经网络实现-K-means clustering-based learning algorithm of rbf neural network

资源分配神经网络解决Mackey-Glass时间序列预测函数逼近问题-Neural network to solve the allocation of resources Mackey-Glass time series prediction function approximation problem

矩阵相乘.zip - C语言源代码 矩阵相乘... - 本人这学期写八数码作业,采用三种人工智能算法,在-matrix multiplication. Zip-C language source code matrix multiplication ...- I wrote this semester eight digital operations, in three artificial intelligence algorithm, the

这是表达支持向量机一个demo，可以帮助更好的理解svm-This is an expression of support vector machine demo, can help a better understanding of svm

Particle Swarm Optimization (PSO) for the TSP

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