-
Matlabsmallprogram
非常好用的MATLAB程序,不下会后悔的(MATLAB is very useful procedure, we will regret over the)
- 2009-04-16 17:26:18下载
- 积分:1
-
vks
EEG signal classification using wavelet feature extraction
- 2011-02-02 01:36:22下载
- 积分:1
-
qiumian
说明: 基于Matlab的基阵方向性仿真,球面坐标网格的基阵方向性图(An Approach of FCM Clustering Segmentation for Building Groups
from Urban Aerial Images
)
- 2009-08-11 02:13:33下载
- 积分:1
-
matlab_fangpengzhuang
RFID标签防碰撞算法研究与仿真分析 matlab程序源代码(RFID tag anti-collision algorithm and simulation analysis matlab source code)
- 2013-10-11 13:26:12下载
- 积分:1
-
蒙特卡洛潮流算法
说明: 区间蒙特卡洛潮流算法,当输入变量为确切区间变化时,采用牛拉法计算在该输入变量下的电网区间状态值(The interval Monte Carlo power flow algorithm is used to calculate the state value of the power grid interval under the input variable when the input variable is the exact interval change.)
- 2021-04-08 16:49:01下载
- 积分:1
-
MOEA-NSGA-II
genetic algorithm program for power system
- 2011-05-29 03:41:08下载
- 积分:1
-
chap3_09_DMRAS_ordn_d
在自动控制系统的过程中,DMRAS稳定方程 持续时间 稳定时间 动态响应(In the process of automatic control system, DMRAS stability equation dynamic response settling time duration)
- 2013-09-04 14:55:03下载
- 积分:1
-
APF
使用matlab编写有源滤波器,控制方法为滞环比较法(use matlab to edit active power filter,the controlling method is hysteresis comparison method)
- 2015-04-29 08:17:37下载
- 积分:1
-
communication-arduino-c
Communicate with a seriel port, specially with an arduino
- 2014-01-29 15:42:23下载
- 积分:1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分:1