搜索资源列表
global_mini
- 寻找函数的全局极小值，global minimization of contrast function with random restarts the data are assumed whitened (i.e. with identity covariance matrix). The output is such that Wopt*x are the independent sources.-Find function of the minimum value of the overa
guangjinfenge
- 黄金分割搜索法的vc代码，有两个过程实现，分别是Golden和mnbrak，mnbrak利用黄金比率和二次插值确定函数的极小值点的所在区间，Golden用黄金分割法求一元函数的极小值。-Golden Section Search vc law code, there are two processes to achieve, and Golden were mnbrak. mnbrak golden ratio and use quadratic interpolation function t
Scalable_MPEG_compression
- 本程序的目的是通过变化DCT系数以及寻找可以应用的DCT系数的最小值来进行可扩展的MPEG压缩，并且能都达到一个可以接收的效果。-the purpose of this procedure is adopted, as well as changes in DCT coefficients can be used to find the minimum value of the DCT coefficients to Progressive firms will be able to expan
ImagesegmentationBasedonGeneticAlgorithmandNeuraln
- 本文深入研究了 BP 神经网络与遗传算法理论，BP 神经网络在应用过程中面临 着网络训练时间长、容易陷入局部极小值、隐层节点数不易确定等缺点，为了有效 地克服 BP 网的困难，将遗传算法与 BP 网络有机地融合，使它们之间的相互补充增 强彼此的能力，从而获得更有力的解决实际问题的能力。 -this in-depth study of artificial neural networks and genetic algorithms theory, BP neural networ
GA1
- 使用遗传算法求函数的极小值的一个例子，使用遗传算法求函数的极小值的一个例子-the use of genetic algorithms to find the minimum value function of an example, the use of genetic algorithms to find the minimum value function of an example
BP_GA.用BP网络建立映射关系
- 用BP网络建立映射关系，为遗传算法提供适应度函数，通过改进遗传算法完成最小值优化,the mapped relation is built using BP network in order to provide fitness function for genetic algorithm. At last, optimization of minimum value is finished by genetic algorithm.
最小费用最大流算法通用Matlab程序
- 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 ％ 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 ％ 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 ％ 确定,如此多次迭代,最终得到最小费用最大流.,Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most shor
sliding
- 求出sliding window的最大最小值-n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves ri
PSO_solution_to_economic_dispatch
- 利用PSO算法解决经济批量分发问题的matlab源代码，求解多目标函数与成本最小值。-Use PSO algorithm to solve economic volume distribution of the matlab source code for solving multi-objective cost function and the minimum value.
optimizatiom-ariszheng2005
- 关于最大最小值，用拉格朗日乘子算法来解决。-Minimum value on the largest, with Lagrange multipliers to solve the algorithm.
fortran
- 找出txt文件的最大值和最小值。要输入文件的行数和列数-Txt file to find the maximum and minimum value. To enter the file number of rows and columns
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
fenlipu
- 本程序是基于分离谱算法的最小值选中次数加权算法的MATLAB源代码,可以对一维信号先进行谱分离,然后再在最小值的基础上对信号进行重建.-This procedure is based on the sub-out algorithm to select the minimum number of weighted algorithm MATLAB source code, can be conducted one-dimensional spectral signal separation, t
danchunxing
- 单纯型搜索MATLAB程序，用于搜索多变量函数的局部极小值。-Search MATLAB simple procedure used to search for multi-variable function of the local minimum value.
Exam094
- 遗传算法，通过对多项式求最小值，介绍遗传算法，用了srand()和rand()两个函数-Genetic algorithm, the minimum value of the polynomial order to introduce genetic algorithm, with the srand () and rand () function of two
maandian
- 找马鞍点：1. 若在矩阵Am×n中存在一个元素A[i][j]，其满足A[i][j]是第i行元素中最小值，且又是第j列元素中最大值，则称此元素为该矩阵的一个马鞍点。用二维数组存储矩阵Am×n ，设计算法求出矩阵中所有马鞍点。-Find a saddle point: 1. If in the matrix Am × n, there is a element of A [i] [j], the meet A [i] [j] is the first line element in the mini
desc
- 最速下降法 求极小值问题的程序示例 其中包含三个函数-Steepest descent procedure for seeking the minimum value problem examples
GA--Minimum-value
- 使用遗传算法 快速求函数最小值 -GA Minimum value
The-minimum-Powell-
- Powell法求多元函数极小值 具体可以下载下来-Powell method for multi-function specific minimum value can download it and see
Unconstrained--extreme-value-problem
- 无约束一维极值问题用来确定求解极小值的搜索空间的算法-Algorithms Unconstrained one dimensional extremum problem solving to determine the minimum value of the search space