资源列表
matlab
- 在MATLAB开发环境下实现的遗传算法程序-In the MATLAB development environment to achieve the genetic algorithm procedure
midujuli
- 本算法是基于一种密度和距离混合聚类算法的研究-The algorithm is based on the density and distance of a Hybrid Clustering Algorithm
bp
- 这是我的一个作业，本人初学神经网络，希望大家多提些意见-This is one of my operations, I am learning neural networks, hope that we talk too much about these views
PSO
- 粒子群算法，通过理解，自己写出的原代码，供大家参考-Particle swarm optimization, through understanding, to write their own original code, for your reference
TSP_ga
- TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序-TSP problem (also known as: traveling salesman problem, traveling salesman problem) genetic algorithm matlab common procedures
ants
- 蚂蚁算法伪码 蚂蚁算法解决TSP问题的C++程序-Ant Algorithm pseudo-code ant algorithm to solve TSP problems C++ Procedures
nnfpe
- This function calculates Akaike s final prediction error ％ estimate of the average generalization error for network ％ models generated by NNARX, NNOE, NNARMAX1+2, or their recursive ％ counterparts. ％ ％ [FPE,deff,varest,H] = nnfpe(method,Ne
marq
- ％ Train a two layer neural network with the Levenberg-Marquardt ％ method. ％ ％ If desired, it is possible to use regularization by ％ weight decay. Also pruned (ie. not fully connected) networks can ％ be trained. ％ ％ Given a set of cor
getgrad
- Produces a matrix of derivatives of network output w.r.t. ％ each network weight for use in the functions NNPRUNE and NNFPE.-Produces a matrix of derivatives of network output wrt each network weight for use in the functions NNPRUNE and NNFPE.
SourceCode
- 本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难为它.希望广大的人工智能爱好者能写出更好的启发函数.-This procedure adopted by the heuristic function, I can not prove that it can resolve any of the eight digital dilemma, if the more difficult the proble
ANN-moving-robot
- 运用人工神经网络和遗传算法实现机器人程序能够自动排除地图中的障碍物。-The use of artificial neural networks and genetic algorithm procedures robot can automatically rule out the possibility of obstructions map.
Generic-Algorithm-for-TSP
- 运用优化遗传算法解决100个城市的TSP问题，即要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程最小。-Optimize the use of genetic algorithms to solve 100 cities TSP problem, which was to select a departure from the resident, after each city once again, and finally returned to the resident