-
matlab3
matlab高级编程 课本中的源代码 作者谷源涛(" Matlab Advanced Programming," in the source code for textbook authors Gu Yuan Tao)
- 2009-11-10 23:39:14下载
- 积分：1
-
ForestFire
森林火灾仿真，元胞自动机，可视化设计，非常经典(Forest fire simulation, cellular automata, visual design, very classic)
- 2014-02-08 19:48:13下载
- 积分：1
-
MATLAB
测量稀土元素的光谱的matlab程序,可以作图，十分简单方便(REE spectra measurements matlab program, you can plot is very simple and convenient)
- 2014-01-03 11:24:32下载
- 积分：1
-
Fastdecoupled
Fast Decoupled Power Flow
- 2013-10-06 08:55:30下载
- 积分：1
-
zgiurare
详细画出了时域和频域的相关图，包括回归分析和概率统计，滤波求和方式实现宽带波束形成，插值与拟合，解方程，数据分析，ICA（主分量分析）算法和程序，毕业设计有用，加入重复控制。( Correlation diagram shown in detail the time domain and frequency domain, Including regression analysis and probability and statistics, Filtering summation way broadband beamforming, Interpolation and fitting, solution of equations, data analysis, ICA (Principal Component Analysis) algorithm and procedures, Graduation useful Join repetitive control.)
- 2016-04-14 12:54:36下载
- 积分：1
-
GM
说明： 用matlab编写的灰色模型程序，可以实现拟合(Gray model
)
- 2011-12-10 10:39:18下载
- 积分：1
-
程序 (1)
数模2015A题程序设计，给定影子长度计算所在位置的经纬度。(MCM 2015A The program design of digital and analog question 2015A calculates the longitude and latitude of the position given the shadow length.)
- 2020-06-16 04:20:01下载
- 积分：1
-
ELECTRONICA
Unit of elctronic aplicatiosn
- 2010-09-24 23:13:25下载
- 积分：1
-
Matlab_zuixiaofeiyong
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:55:22下载
- 积分：1
-
pudn
SIMPLE integer programming with pso
- 2014-10-21 02:10:32下载
- 积分：1
