机器人仿真软件有助于从事着学习，方便编程操作，能很快的知其原理...

这是一本详细介绍遗传算法理论，及其在工程方面应用的书籍，书中包含许多实例，实在是不可多得的经典之书-This is a detailed theory of genetic algorithm and its applications in engineering books, the book contains many examples, it is rare classic book

遗传算法进行优化神经网络结构-genetic algorithm optimization neural network architecture! !

包含了许多的最优化算法，有牛顿法，单纯形法等，都已运行通过了-Contains a number of optimization algorithms, there is Newton" s method, simplex method, etc., have to run through the

用C++实现了期望最大化算法，为了简化，矩阵使用对角矩阵-C achieve expectations maximize algorithm, in order to simplify the use of matrix diagonal matrix

这是目前网上所能找到的最全面的adaboost的C++算法，但是需要自己训练的数据-This is the Internet can find the most comprehensive adaboost C algorithms, However, it needs its own training data

本代码用基于steve语言的breve软件编写的，此软件是一种3D人工智能的环境模拟器，可以用来构建AGENT-BASED SYSTEM和模拟机器人行为。本代码实现功能如下：机器人服务模拟。自动取得饮料，递送给客人，客人喝完后，另一种清理机器人处理瓶子并运送垃圾堆。主要为了证明机器人运动中的一种Deliberative设计结构。软件下载地址：http://www.spiderland.org/breve/download.php 打开我上传的文件后，点运行就可以看效果。-The code-based software steve language breve prepared, the artificial intelligence software is a 3D environment simulator can be used to build the AGENT-BASED SYSTEM and robot behavior simulation. Realize this function code is as follows: service robot simulation. Automatically beverages, delivered to the guests, the guests after the finish, another robot cleaning up the bottle and the delivery of garbage treatment. Mainly in order to prove that the movement of a robot design structure Deliberative. Software Download: http://www.spiderland.org/breve/download.php open my uploaded file, you can look at the effect of running.

径向基网络对Polynomial函数的逼近和拟合-Radial basis function networks Polynomial Approximation and fitting

c++学习初步-c++ preliminary study

WinSVM支持向量机预测分类使用指导书-WinSVM support vector machine classification for prediction guide book

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.