搜索资源列表
ACO_Peng_V4
- 这是我用matlab编写的，利用蚁群算法（ACO）求连续函数最优解的源码。是对段海滨《蚁群算法原理及应用》一书中，网格策略法的实现。-This is my prepared using Matlab, using ant algorithms (ACO) function for the optimal solution for the source code. On the waterfront of the "ant colony algorithm and application
ant_colony_optimization
- 实现了一种高效的蚁群算法,它在旅行商问题中进行了测试-an effective and efficient aco
aco
- Contour Correspondence via Ant Colony Optimization Oliver van Kaick <ovankaic@cs.sfu.ca> http://www.cs.sfu.ca/~ovankaic/personal/ This MATLAB implementation computes a correspondence between two shapes based on ant colony optimi
aco-v1.1
- This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.
aco-v1.1
- This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points. The algorithm is described in de
aw2
- 基于改进半软阈值降噪法的输电线路故障测距.-Based on the improved half soft threshold denoising method in the fault location of transmission line.
ACO
- 改进蚁群算法求两点间最短路径，基于matlab-Improved ant colony algorithm for the shortest path between two points, based on matlab
sso_simple
- simplified swarm optimization的matlab版本，可以節省寫程式的時間。本程演算法已驗證可以在某些問題上找到比pso、ga、sa、ts、aco等演算法更好的解。-simplified swarm optimization in matlab version, you can write a program to save time. The scheduling algorithm has been verified can find better than pso,
aco
- 比较好的蚁群算法MATLAB代码,作为学习人工智能算法是比较好的例子-Good ant colony algorithm based on MATLAB code as a learning algorithm is a good example of artificial intelligence
aco-v1.1
- 采用蚁群优化算法的轮廓匹配，输入可以是二值轮廓或者是任意的二维点集-This MATLAB implementation computes a correspondence between two shapes based on ant colony optimization (ACO). The input shapes can be either two 2D contours (open or closed) or two arbitrary sets of 2D points.
aco
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the a