-
200711912175433168
tsp蚂蚁算法的最优化的方法matlab语言(tsp ant algorithm optimization method Matlab language)
- 2007-05-23 10:49:08下载
- 积分:1
-
L01p_e
[x,f]= L01p_e(c,A,b,N)用枚举法求解下列
0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式,N= 0时可以省略。 返回结果x是最优解,f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)
- 2013-07-16 21:51:03下载
- 积分:1
-
qiantuihuitui
运用前推回推法进行配电网潮流计算。附有33母线系统数据,以供检验。程序没有考虑电容器、分布式电源,以及弱环网的影响。(Before using push back push power flow calculation method. With 33 bus system data for testing. The program does not consider the capacitor, distributed power, and the impact of the weak ring network.)
- 2014-09-26 19:48:21下载
- 积分:1
-
pca
主成分分析 pca函数代码,用于数据的降维、压缩、去噪、主成分分析等方面。。。(principal component analysis)
- 2012-08-25 16:31:52下载
- 积分:1
-
ReMosaic.m
RGB picture remosaicing to state before coded thoug bayer matrix
- 2015-01-24 18:05:36下载
- 积分:1
-
solar-cell
about maximum peak power tracking
- 2014-01-23 13:12:27下载
- 积分:1
-
CTBXZ
动态电力系统次同步谐振.次同步谐振一是交流输电系统中由串联电容补偿引起的次同步谐振问题,二是由一些电气装置引起的次同步振荡问题。次同步振荡会使轴系产生很大的扭矩,严重情况下可能导致大轴出现裂纹甚至断裂, 或因反复承受较大转矩造成疲劳积累, 使轴系寿命降低。因此,对次同步振荡进行准确的分析和计算, 采取有效的监视、防止和保护措施是非常重要的。程序是对交流线路串补偿电容引起的次同步振荡抑制的编程。(dynamic power system subsynchronous resonance.)
- 2016-01-21 21:06:27下载
- 积分:1
-
For2008a
ACOUNT: 用于A 方向灯的时间显示,8 位,可驱动两个数码管;
BCOUNT: 用于B 方向灯的时间显示,8 位,可驱动两个数码管。*/
module traffic(CLK,EN,LAMPA,LAMPB,ACOUNT,BCOUNT)
output[7:0] ACOUNT,BCOUNT
(reg[7:0] numa,numb
reg tempa,tempb
reg[2:0] counta,countb
reg[7:0] ared,ayellow,agreen,aleft,bred,byellow,bgreen,bleft
reg[3:0] LAMPA,LAMPB
always @(EN)
if(!EN)
)
- 2010-06-23 14:39:58下载
- 积分:1
-
matlab
微分方程的matlab解法,实用性较强,易于参考(Solution of differential equations matlab, practical, strong, easy reference)
- 2010-10-06 17:33:31下载
- 积分:1
-
tulunzuiduanlumatlabcode
解决图论中最短路问题的最好方法--“Dijstra算法,”通过解析实例模型,对模型算法进行描述、拓展,并给出了求最短路以及求最短路长的MATLAB程序,此程序具有通用性。(The best way to solve the shortest path problem in graph theory is- "Dijstra algorithm," by parsing instance model, the model describes the algorithm, expand, and gives the shortest and seek seek the shortest length of the MATLAB program, this program has versatility.)
- 2013-12-14 15:48:37下载
- 积分:1