in vc console operations, Genetic Algorithm for the shortest path, adjacency mat...

微分进化算法的Labview版本，内为一个无约束连续变量的全局优化问题-Differential evolution algorithm Labview version, for a continuous variable unconstrained global optimization problem

Dynamic Programming Code for the TSP

基本的神经网络计算TLU，对于所有学习神经归纳的第一个算法来说，单个神经容易做训练，虽然不会有问题的异或解，但它是人类神经史上的第一步。

TSP问题是组合优化中的经典问题。其解决方法有局部优化方法和一些启发式算法,局部搜索方法充分考虑问题 的邻域结构,遗传算法有很好的全局搜索能力,memetic算法把遗传算法和局部优化算法相结合,试验结果证明,能很好地解 决TSP问题。-TSP problem is a classic combinatorial optimization problem. Its solution has a number of local optimization methods and heuristic algorithms, local search methods take full account of the issue of neighborhood structure, genetic algorithm has good ability of global search, memetic algorithm for the genetic algorithm and local optimization algorithm combining test results proved that well positioned to solve the TSP problem.

自组织神经网络用于图像分割matlab实现-self-organizing neural networks for image segmentation achieve Matlab

用A*算法解决八数码问题的小程序，特别好的程序代码-With A* algorithm to solve the problem of a small digital 8 procedures, in particular, a good code

神经网络C程序的第10章-neural network C procedures for the Chapter 10

采用的是康力山等人确定的实验参数。 对于n个城市的旅行商问题，其参数如下： 初始温度：t0=280, 每一个温度下采用固定的迭代次数L=100n, 温度的衰减系数alpha=0.92 算法停止的准则是当相邻两个温度得到的解变化很小时算法停止。-used the Stanozolol Hill were determined by the experimental parameters. N cities for the traveling salesman problem, the parameters are as follows : initial temperature : t0 = 280, each a fixed temperature of the iteration number L = 100n, temperature attenuation coefficient alpha = 0.92 algorithm to stop the criteria when two adjacent the temperature change was very Solution Algorithm stop.

改进的量子搜索算法的论文，用于模式识别等方面-Quantum search algorithm to improve the paper for pattern recognition, etc.

介绍人工智能语言Prolog的书籍-introduced artificial intelligence language books Prolog