genetic algorithm optimization neural network architecture! !

Scalable k-means software and test datasets This package (a Unix tar file, gzipped) contains the source code for the software that was used to run the experiments for the article -Scalable k-means software and test datasets This package (a Unix tar file, gzipped) contains the source code for the software that was used to run the experiments for the article

神经网络全部源代码-neural network full source code

人工智能里的A-star算法,用于机器人的路径规划和寻优.-AI"s A-star algorithm for robot path planning and optimization.

落煤残存瓦斯量的确定是采掘工作面瓦斯涌出量预测的重要环节,它直接影响着采掘工作面瓦斯涌出量预测的精度,并与煤的变质程度、落煤粒度、原始瓦斯含量、暴露时间等影响因素呈非线性关系。人工神经网络具有表示任意非线性关系和学习的能力,是解决复杂非线性、不确定性和时变性问题的新思想和新方法。基于此,作者提出自适应神经网络的落煤残存瓦斯量预测模型,并结合不同矿井落煤残存瓦斯量的实际测定结果进行验证研究。结果表明,自适应调整权值的变步长BP神经网络模型预测精度高,收敛速度快 该预测模型的应用可为采掘工作面瓦斯涌出量的动态预测提供可靠的基础数据,为采掘工作面落煤残存瓦斯量的确定提出了一种全新的方法和思路。-charged residual coal gas is to determine the volume of mining gas emission rate forecast an important link, which directly affect mining gas emission rate forecast accuracy, and with coal metamorphism, loading coal particle size, the original gas content, exposure time and other factors nonlinear relationship. Artificial neural networks have expressed arbitrary nonlinear relationships and the ability to solve complex nonlinear, time-varying uncertainty and the new ideas and new approaches. Based on this, the author of adaptive neural network loading coal residual gas production forecast model, and a combination of different loading coal mine gas remnants of the actual test results of research

线性M3网络及其示意图，用于检测M3网络冗余的算法-err

这是一个聚类代码，里面有分类数据，有MAKEFILE，可以实现模式的分类中-This is a clustering source code which contains classfication data and MAKEFILE.It can be used in classifying pattens.

一个VC编写的神经网络算法程序，对学智能算法的朋友很有用。-a VC prepared by the neural network algorithm procedures, intelligent algorithm friends useful.

神经网络的HP算法，这是神经网络入门的好程序-HP neural network algorithm, this neural network is a good entry procedures

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

人工智能bp算法程序以及实验报告-bp artificial intelligence algorithms and experimental procedures report