我做的一个用matlab程序编写的BP算法，是是我毕设的一部分，程序运行绝对没有问题，欢迎大家指正。...

用VC++实现的BP（反向传播负反馈）神经网络算法-with VC BP (BP negative feedback) neural network algorithm

使用具有增量学习的监控式学习方法。包括几个不同的分类算法。-use with incremental learning supervised learning method. Including several different classification algorithm.

已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi"an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find the shortest path. 2) find Beijing to Kunming, Shanghai must channel"s path. 3) to find Beijing to Kunming, Shanghai must channels, but can not go to Guangzhou"s path.

ｍａｔｌａｂ编写的计算排序问题或者求最优值问题，适用于数学建模以及工程计算-Matlab calculations prepared by the scheduling problem or seek optimal values, apply to mathematical modeling, and engineering computing

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

实现马尔可夫决策过程模型的算法，该研究方向是当前热门的研究领域。-Markov Decision Process Model realize the algorithm, the research direction is currently a hot research field.

平时学习时搜集的算法书,聚类,神经网络,蚁群算,遗传算法-some e-books about the algorithm

遗传算法的原代码，用于最优化计算，只需解压便可使用。-Genetic algorithm source code for the optimization calculation, just unzip to use.

BP模型逼近异或问题，可观测隐层节点数及隐层数对模型的影响-BP model approximation differences or problems, the observation can be hidden nodes and hidden layers of the model

模糊算法，实现了求交法计算模糊蕴含关系、最大最小法进行合成运算、求并法计算输出量的模糊集合、加权平均法计算实际的清晰控制量等部分的详细代码。-Fuzzy algorithm, the realization of the intersection method to calculate fuzzy implication relations, max-min method for synthesis of computing, and method for output fuzzy sets, the weighted average method to calculate the actual volume of clear control of part of the detailed code.