-
xiao_bo_bao_jiang_zhao_silk3
此程序是matlab中有关平滑去噪中常用的小波包的程序,简单使用,其中的注释详细,对每个变量的注释都很清楚(Sen)
- 2008-08-12 17:07:14下载
- 积分:1
-
admm_lin_inv
ADMM 交替方向乘子法Alternating Direction Method of Multipliers(Alternating Direction Method of Multipliers)
- 2020-09-29 14:27:44下载
- 积分:1
-
ABC_MATLAB_web
ABC算法,有效的ABC使你很容易理解掌握算法基本原理(ABC algorithm, valid ABC makes you easy to understand the basic principles to master algorithm)
- 2012-05-22 19:56:50下载
- 积分:1
-
随机生成多孔介质matlab程序
说明: matlab生成随机分布纤维代码,用于后续模拟处理(Matlab generates randomly distributed fiber code for subsequent simulation processing)
- 2021-04-28 16:48:44下载
- 积分:1
-
ifndq
说明: 这是一个用来计算给定IMF分量的瞬时频率的模块(The module that calculates an instantaneous frequency for a given IMF)
- 2021-01-11 11:08:50下载
- 积分:1
-
angle
水平测量中求取一测回水平角的简单程序
可以任意限差(A horizontal angle measured back)
- 2010-05-12 14:42:41下载
- 积分:1
-
mypuma
机器人二维绘图的matlab程序,应该有二十二个字了吧。(Robot dimensional drawing matlab program, there should be twenty-two word of it.)
- 2013-11-04 12:43:58下载
- 积分:1
-
AHP-MATLAB
ahp的matlab程序,输入矩阵即可使用(ahp matlab program, you can use the input matrix)
- 2014-02-24 17:26:19下载
- 积分:1
-
Optimal_Power_Flow_Problem_Analysis
电力系统最优潮流问题解析Optimal Power Flow Problem Analysis电力系统最优潮流问题解析(Problem Analysis for Optimal Power Flow Optimal Power Flow Problem Analysis Problem Analysis for Optimal Power Flow)
- 2010-08-08 13:13:24下载
- 积分:1
-
Matlab_zuixiaoerchengfa
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:54:17下载
- 积分:1