immune function algorithm optimization runtime please select the function and im...

遗传算法分层遗传算法-GA GA stratified

道路识别 人工智能方面的道路识别应用-road artificial intelligence to identify the road recognition applications

软件无线电中信号调制方式的识别――用人工神经网络的方法-Software Defined Radio Signal Modulation Recognition- Using Artificial Neural Networks approach

用神经网络算法求解tsp问题。。。matlab编写。附有城市坐标用于检验。 -Using neural network algorithm for solving the problem tsp. . . matlab prepared. Coordinate with the city for inspection.

2。《遗传算法――理论、应用与软件实现》，王小平、曹立明编着 西安交通大学出版社 2002年第一版 本书全面系统地介绍了遗传算法的基本理论，重点介绍了遗传算法的经典应用和国内外的新发展。全书共分11章。第1章概述了遗传算法的产生与发展、基本思想、基本操作以及应用情况；第2章介绍了基本遗传算法；第3章论述了遗传算法的数学基础；第4章分析了遗传算法的多种改进方法；第5章初步介绍了进货计算理论体系；第6章介绍了遗传算法应用于数值优化问题；第7章介绍了遗传算法应用于组合优化问题；第8章介绍了遗传算法应用于机器学习；第9章讨论了遗传算法在智能控制中的应用；第10章讨论了遗传算法与人工生命研究的相关问题；第11章介绍了遗传算法在图像处理、模式识别中的应用。-2. "Genetic Algorithm-- theory, application and software," Wang Xiaoping, Li-Ming Cao compile Xi"an Jiaotong University Press in 2002 the first book version of the comprehensive and systematic introduction of the genetic algorithm"s basic On focuses on the classical genetic algorithm use and the new development. The book is divided into 11 chapters. Chapter 1 provides an overview of the genetic algorithm for the selection and development of basic ideas, basic operation and the application; Chapter 2 introduces the basic genetic algorithms; Chapter 3 of the genetic basis of a mathematical algorithm; Chapter 4 Analysis of the genetic algorithm app

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

简单规则演化出来的极似苍蝇的一个人工生命群体floy-simple rules of evolution as same flies an artificial life groups floy

是实现关系型贝叶斯网络一中机器学习算法，从国外相关研究人员的主页上下载收集。

移动机器人运动学mathematica程序-Mobile robot kinematics mathematica program

BugBots是一个游戏，描述它的最好方式是它是一个测试人工智能的框架。 来源: http://sourceforge.net/projects/bugbots/-BugBots is a game, describing it as the best method is that it is a test of artificial intelligence framework. Source : http://sourceforge.net/projects/bugbots/