-
shishangbaili
说明： 大量的编程，相信对于大家来说是很有帮助的呀！(lot of programming, and I believe everyone is very helpful!)
- 2006-04-13 15:10:12下载
- 积分：1
-
FuzzyPID
说明： 里面有三个二维模糊调节器分别实现PID控制器的参数Kp，ki，Kd，的调节。其控制原理：根据前面的偏差e和偏差变化ec将三个模糊控制器FC1,FC2,FC3分别进行模糊化，模糊逻辑推理，解模糊化。最后得到pid控制器参数调节量。(There are three two-dimensional fuzzy controller to achieve PID controller parameters were Kp, ki, Kd, of the regulation. The control principle: According to the previous error e and error change ec the three fuzzy controller FC1, FC2, FC3 were fuzzy, fuzzy logic, defuzzification. Finally, adjust the controller parameters by pid.)
- 2010-04-28 23:53:42下载
- 积分：1
-
aulaSegv1
background subtraction 2
- 2011-04-29 11:36:17下载
- 积分：1
-
BP-YYSB
使用BP算法实现语音识别及预测的功能，调试可用(BP algorithm to achieve the function of speech recognition and forecast)
- 2012-05-18 22:16:12下载
- 积分：1
-
matlab-self-taught-60-codes
自学Matlab必备的60个小程序代码.(Self-study Matlab necessary 60 small code
)
- 2013-12-25 21:03:28下载
- 积分：1
-
BP_neural_network
说明： 可以使用BP神经网络对矩阵形式的数据进行训练，并且进行数据预测，代码注释详细(BP neural network can be used to train the data in matrix form, predict the data, and annotate the code in detail)
- 2020-01-28 10:34:08下载
- 积分：1
-
selrpt_frsz
Computer Networking - Selective Repeat
- 2013-07-31 16:41:44下载
- 积分：1
-
matlab-code-of-sr
运用matlab仿真随机共振 。哪有那么多的说明(failed to translate)
- 2013-05-03 07:58:48下载
- 积分：1
-
粒子群优化算法优化BP神经网络的源代码
粒子群优化算法优化BP神经网络的源代码，基础的值得参考下(Particle swarm optimization algorithm to optimize the source code of BP neural network)
- 2020-12-14 19:59:14下载
- 积分：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
