搜索资源列表
binary
- 利用遗传算法求最小值，程序中求得是表达式x1*x1+x2*x2+x3*x3再-2~2上的最小值，以及对应的x值，算法中使用二进制编码，交叉采用不同交叉和优势交叉，变异也分两种，不用变异和优势变异-using genetic algorithms for the minimum, procedures to seek expressions x1 x1 x2 * * * x2 x3 x3 another 2 ~ 2 on the minimum, and the corresponding val
用Delphi开发的遗传算法源程序
- 开发环境:Delphi 简要说明:TGABase is a abstract class. You must Derivate a sub_class from it. You must override abstract function calculateFitness. By the way, this class can only get minimum solution -development environment : Delphi Brief Descr iption :
模拟退火程序
- 以一个简单的例子说明模拟退火算法的思想。 模拟退火法求函数f(x,y) = 5sin(xy) + x^2 + y^2的最小值，对理解模拟退火算法是一个很好的程序示例。-to a simple example illustrates the simulated annealing algorithm thinking. Simulated Annealing for the function f (x, y) = 5sin (xy) x ^ 2 y ^ 2 minimum, the right u
matlab作业
- 模式识别一份很好的作业,包括线性分类器；最小风险贝叶斯分类器；监督学习法分层聚类分析；K－L变换提取有效特征,支持向量机-a very good operation, including linear classification; Minimum risk Bayesian classifier; Supervised learning method Hierarchical clustering analysis; K-L transform effective features, supp
模拟退火例子1
- 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对
模拟退火例子2
- 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对
模拟退火例子3
- 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对
vb-GA
- 用VISUAL BASIC写的遗传算法模板,可以实现一元高次方程的最大值或最小值的求解-with VISUAL BASIC to write the genetic algorithm template, one yuan can achieve high equation maximum or minimum Solution
jswarm-pso_1_1
- JSwarn 是微粒群优化(PSO) 程序包被写在Java. 设计要求极小的工作成绩使用(在配件箱外面) 虽然同样高模件。 -JSwarn Particle Swarm Optimization (PSO) package written in Java. The minimum design requirements of the Public results for the use (in the outside box accessories) Although the same hig
rbfSrc
- This program demonstrates some function approximation capabilities of a Radial Basis Function Network. The user supplies a set of training points which represent some \"sample\" points for some arbitrary curve. Next, the user specifies the number o
231565262
- 对于个顶点的连通网可以建立许多不同的生成树，每一棵生成树都可以是一个通信网。现在，我们要选择总的耗费最小的那棵树，这就是我们说的最小生成树。本次课程设计就是设计这样的生成树，-for network connectivity can be established in many different spanning tree, every one spanning tree can be a communications network. Now, we have to choose the l
QP_suanfa
- 测试无约束优化定理求解最小值,包括测试数据,在VC下可以实现,已经调试成功.-test unconstrained optimization for minimum theorem, including test data, the VC can be achieved, debugging has been successful.
chap5_1
- 基于实数编码遗传算法的PID整定,采用误差绝对值积分性能指标作为参数选择的最小目标函数-real-coded genetic algorithm PID tuning, integral absolute error performance parameters as the minimum objective function
mRMRFeatureSelection
- mRMR_0.9_compiled最小冗余和最大相关特征选取源代码，-This package is the mRMR (minimum-redundancy maximum-relevancy) feature selection method, whose better performance over the conventional top-ranking method has been demonstrated on a number of data sets in recent pu
Steepest
- 计算梯度下降法计算极值，只能找到局部最小点。可以通过调整步长实现全局最小-Calculation of gradient descent method to calculate extreme value, can only find local minimum point. By adjusting the step size can achieve the global minimum
MATLAB
- MATLAB中GA遗传算法工具箱帮助信息-Find the minimum of a function using genetic algorithm
facedetection
- PCA、LDA人脸检测，压缩包里实现了PCA、LDA、最小距离分类器，人脸检测！-PCA, LDA face detection, compression bag to achieve the PCA, LDA, minimum distance classifier, face detection!
Genetic-Algorithm-for-Minimum-SpanningTree
- 使用遗传算法求解最小生成树的编码，C++环境-Genetic Algorithm for Minimum Spanning Tree
Steiner
- 遗传算法在Steiner树中的应用 遗传算法的相关论文-In order tO solve the subject of Steiner minimum spanning tree，an adaptive genetic algorithm is introduced．The Steiner minimum spanning tree is transformed into a combination-optimization problem and a triabselection m
GA--Minimum-value
- 使用遗传算法 快速求函数最小值 -GA Minimum value