资源列表
paes
- 一个非常好用的多目标进化算法，可以轻松的达到PARETO前端-MOEA
BP
- 人工神经网络的C语言实现，程序涉及梯度下降法，函数求逆及偏导数的实现-Artificial Neural Networks C-language implementation, the program involves gradient descent method, function inverse and the partial derivative of the realization of
TSP_hopfield
- 通过hopfield神经网络解决TSP商务旅行商问题，找出一条最短路径！-By hopfield neural networks to solve traveling salesman problem TSP business, find a shortest path!
ISODATA
- 本例为等度规映射的C++算法实现，包含了使用方法。-In this case ISOMAP of C++ algorithm includes the use of methods.
PathPlanningforMobileRobotBased0nBPNeuralNetworkAl
- 这是一篇介绍BP神经网络在移动机器人路径规划方面的论文-Abstract：Improves the BP neural network algorithm，so the shortage of path —planning with the ． BP neural network algorithm is overcomed ．The simulation results indicate that on the bases of accessional momentum met
PathPlanningforMobileRobotsBasedontheNeuralNetwork
- ：针对移动机器人传统路径规划算法效率不高，寻优能力差等问题，提出一种基 于神经网络和粒子群优化算法相结合的移动机器人路径规划方法．该方法利用神经网 络实现大量的并行和分布计算，发挥PSO简单、容易实现的优点，提高了路径规划的计 算效率和可靠性．仿真结果表明，这种新路径规划方法是可行且有效的．-The quality and eficiency of calculation is the two puzzling problems in the tradi— tional algo
AIA2
- 人工免疫克隆选择算法是一种比较新型的智能算法，其基本算法结构与遗传算法是类似的，以下源码是为网络节点分组调度问题而设计的算法。-Artificial immune clonal selection algorithm is a relatively new type of intelligent algorithms, the basic algorithm structure and the genetic algorithm is similar to, the following sour
BMDCP
- 突变分为如下主要的几种：均值突变（最常见）、方差突变、线性回归突变（也称趋势突变）、概率突变、空间型突变、谱突变、模型参数突变，等等。贝叶斯突变检测属于概率突变检测方法，其特点是能给出突变点的概率分布图。-Mutations are divided into the following main categories: the mean mutation (the most common), variance mutation, linear regression mutation (also
mpi-ikl-simplemkl-1.0.tar
- This package contains an implementation of the Infinite Kernel Learning (IKL) algorithm and the SimpleMKL algorithm. This is realized by building on Coin-Ipopt-3.3.5 and Libsvm.
testRBF
- 径向基函数网络实现非线性系统的参考模型自适应控制，matlab程序，注释非常详细。-Radial basis function networks of nonlinear systems model reference adaptive control, matlab program, very detailed comments.
pso-ppt-sample
- 微粒群优化算法 （PSO） 是一种进化计算技术 , 由Eberhart博士和kennedy博士于1995年提出。微粒群优化算法的基本思想是通过群体中个体之间的协作和信息共享来寻找最优解。 -Particle Swarm Optimization (PSO) is an evolutionary computation technique, by Dr. Eberhart and Dr. kennedy made in 1995. Particle Swarm Optimization Alg
sa-ppt-sample
- 模拟退火算法最早的思想由Metropolis等（1953）提出，1983年Kirkpatrick等将其应用于组合优化。-Simulated annealing algorithm was first thought by Metropolis et al (1953) suggested that, in 1983, Kirkpatrick and so on will be applied to combinatorial optimization.