-
MSMC4.5
Multiscale M decision tree
- 2009-09-05 19:50:08下载
- 积分：1
-
COMPUTEG
computes the gravitational acceleration vector at a specified
％ ECF location using the JGM2 gravitational ellipsoid only.
％ Higher-order gravity terms (the "gravity anomaly") are
％ ingnored. Only the pure ellipsoid is used.
(computes the gravitational acceleration vector at a specified ECF location using the JGM2 gravitational ellipsoid only. Higher-order gravity terms (the gravity anomaly ) are ingnored. Only the pure ellipsoid is used.)
- 2007-12-20 00:07:29下载
- 积分：1
-
codeofroughset
粗糙集的基本算法，包括数据补齐，属性约简，值约简，规则生成，非常实用。(Rough set theory is a new mathematical approach to imperfect knowledge. The problem of imperfect knowledge has been tackled for a long time by philosophers, logicians and mathematicians. Recently it became also a crucial issue for computer scientists, particularly in the area of artificial intelligence. )
- 2010-11-09 21:11:00下载
- 积分：1
-
fenzu
对数据进行分组：通过该程序在matlab将一组数据随机的分为两组，用于建模计算(devide into two groups)
- 2013-10-30 21:59:28下载
- 积分：1
-
DES
DES加密过程 实现了DES的全部过程
加密算法经典易学(DES Encryption process
To achieve the whole process)
- 2011-12-04 12:29:19下载
- 积分：1
-
lansvd
Lazsvd矩阵的SVD分解，MATLAB程序。(SVD decomposition of Lazsvd matrix)
- 2017-12-21 15:23:04下载
- 积分：1
-
Jacobi
普通解矩阵时，在计算量想当大时候，会出现病态矩阵，这个程序采用迭代方法计算。(it s a way to calculate the matrix.everyone can have a try .solving the matrix is a problem ,this maybe can help you~)
- 2010-06-21 18:03:10下载
- 积分：1
-
part_III
Adaptive signal processing Sayes s book computer project solution part3
- 2011-05-25 15:53:33下载
- 积分：1
-
GAforPathPlaning
说明： 采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。
利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。
用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve.
The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles.
The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)
- 2019-05-02 14:56:19下载
- 积分：1
-
template
说明： 多目标遗传算法二代，可直接使用，内有详细说明(NSGA_2,can be used directly,which is explained in detail)
- 2020-08-24 10:12:14下载
- 积分：1
