资源列表
zhihebi
- 一个关于秩和比的源代码，很有用的。快来试试吧-One on RSR source code, very useful
GPC_MATLABFUNC
- 是GPC结合SIMULINK的仿真程序。-GPC combined with SIMULINK simulation program
knnClassification
- 十大经典人工智能算法之一——K最近邻Matlab实现-One of the top ten classical artificial intelligence algorithms- K nearest neighbor Matlab implementation
F-K
- 地球物理地震学——基于FK域的波场分离，也可应用于滤波-FK domain wave field separation, can also be applied to filter
threePatternMatching
- 东南大学研究生课程 算法分析与设计 三种模式匹配算法的比较-three pattern matching
Random-access-algorithm
- 东南大学研究生算法与设计课程编程实现作业5-22 随机取数算法实现-Southeast University Graduate programming algorithms and design courses jobs 5-22 random access algorithm
TSP
- cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。-storage cost of a strongly connected graph edge weight matrix, as an example. Loaded in the workspace using this algorithm is to pay attention to several tests.
MazeGameBasedonGeneAlgmBeta2.0
- 人工智能作业程序改进版 基于遗传算法的迷宫问题实现 区别于经典遗传算法，本算法中引入了人工选择的方式，对优质基因进行保护，大大提高了种群进化的速度-Artificial intelligence operating procedures improved version of the maze problem based on genetic algorithms to achieve distinct from classical genetic algorithm, this algorit
asfsa
- 遗传算法程序: 说明: fga.m 为遗传算法的主程序 采用二进制Gray编码,采用基于轮盘赌法的非线性排名选择, 均匀交叉,变异操作,而且还引入了倒位操作!-Genetic Algorithm: Descr iption: fga.m the main program for the genetic algorithm using binary Gray code, roulette method based on nonlinear ranking selection, unifor
MazeGameBasedonGeneAlgm
- 人工智能大作业 基于经典遗传算法实现的迷宫程序 输入杂交率和突变率 按照遗传算法得到种群中优势个体 距离走出迷宫更近的个体最为优势-Great job is based on artificial intelligence classical genetic algorithm maze procedure input hybridization rate and mutation rate in accordance with the dominant population genetic a
netman_ultimate
- *软件，属于远程控制软件，其主要目的监控孩子上网.-Gray pigeon software, belongs to a remote control software, its main purpose monitor kids online.
dijk1
- Dijkstra算法,关于 Dijkstra算法解决voronoi图的问题,用 Dijkstra算法解决voronoi图中求解最短路径的时候,有一个"dijkstra.m"的文件-Dijkstra algorithm voronoi diagram on Dijkstra algorithm to solve the problem, using Dijkstra algorithm to solve voronoi diagram for solving the shortest path,