-
Ogata_Modern_Control_Engineering
It is a modern control engineering book It is a modern control engineering book It is a modern control engineering book It is a modern control engineering book It is a modern control engineering book
- 2010-09-25 01:10:52下载
- 积分:1
-
matlab
模式识别中的线性分类器的设计,包括感知机,最小二乘法和支撑矢量机的算法的MATLAB代码。(Pattern Recognition linear classifier design, including perception, least squares and support vector machine algorithm MATLAB code.
)
- 2010-05-24 15:20:34下载
- 积分:1
-
ChannelCoding1
ChannelCoding it s easy to understand for you
- 2010-06-08 01:52:45下载
- 积分:1
-
PQ_Control
基于LCL的三相逆变器并网恒功率PQ控制模型,输出稳定,谐波滤除效果非常好(LCL-based three-phase inverter and constant power PQ network control model, output stability, harmonic filter effect is very good)
- 2020-12-29 16:29:01下载
- 积分:1
-
3章matlab
构建模型,并进行中断概率matlab仿真(Build the model for matlab simulation, solve the probability of interruption)
- 2020-10-13 22:07:32下载
- 积分:1
-
droop_control
第二种孤岛运行的控制是采用下垂控制(droop控制),Droop控制就是用来模拟频率一次调整。通过控制电力电子逆变器来实现。(The second kind of island operation control is droop control, Droop control is used to simulate a frequency adjustment. It is realized by controlling the power electronic inverters.)
- 2021-02-05 22:19:57下载
- 积分:1
-
分支定界法
说明: 分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1]
通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分:1
-
JSPMATLABsourcecode
车间作业调度问题遗传算法通用MATLAB源程序(the source code is for the workshop schedule program with matlab)
- 2009-04-30 10:15:29下载
- 积分:1
-
wig
squirel cage induction generator with wind turbine
- 2009-12-01 19:41:30下载
- 积分:1
-
V1Features
This is an archive for feature extraction.
- 2013-04-05 20:00:18下载
- 积分:1