-
flowshopcoding
the coding of genetics algorithm in 5 machines and 5 jobs...the coding uses matlab 7.0 release 14
- 2009-12-15 11:33:20下载
- 积分:1
-
zweipunkt_regelung
simulink model of a two point control function
- 2011-06-13 00:53:23下载
- 积分:1
-
spars-array
稀疏阵的方向图仿真,给出了不同条件下的稀疏阵列的方向图(This is the simulate about sparse array ,different conditions have been taken into account )
- 2021-04-14 10:48:56下载
- 积分:1
-
imgsteg
THIS CODE IS REG.IMAGE STEGNOGRAPHY
- 2014-09-21 14:10:28下载
- 积分:1
-
Based-on-HHT-power-quality
基于HHT的一种新的电能质量检测的系统的研制。使用了matlab和EMTDC(Based on HHT a new power quality detection of the System. Using matlab and EMTDC)
- 2013-11-09 19:07:31下载
- 积分:1
-
timeanalysis
运用matlab实现计算机声卡采集信号并进行时域分析,直接运行即可。(Data acquisition & time domain analysis)
- 2013-03-08 10:13:51下载
- 积分:1
-
nnd3hopc_883707972
神经计算,本代码主要介绍BP神经算法的主要步骤,非常简单有很明了,非常适合阅读
(Neural computing, the main source of the main steps of BP algorithm is very simple, very clear, very suitable for reading)
- 2015-04-20 09:53:19下载
- 积分:1
-
CST_MPI
电磁场仿真软件CST,并行计算设置方法。(Electromagnetic simulation software CST, parallel computing setting method.)
- 2014-01-12 22:54:24下载
- 积分:1
-
lp_solve_MATLAB
一个matlab的线性规划的工具箱,不同与matlab自带的函数,功能强大,里面带有该工具箱的使用例子,操作简单。(A matlab toolbox for linear programming, different with matlab built-in function, a powerful inside the toolbox with the use of examples, easy to operate.)
- 2007-12-23 12:04:16下载
- 积分: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