-
BTfangzhen
BT法仿真，DFT变换，窗函数，功率谱，将加窗之后进行了补零(signal process)
- 2014-10-27 19:51:19下载
- 积分：1
-
Q学习
实现Q学习算法，动作选择策略为贪婪策略，存在收敛判断条件。(Implementing Q-learning algorithm, action selection strategy is greedy strategy.There is a convergence judgment condition.)
- 2021-01-18 10:08:44下载
- 积分：1
-
msk-modulator
matlab msk modulator + gaussian filtr and GMSK modulator
- 2015-03-07 20:55:25下载
- 积分：1
-
Mackey-Glass
Mackey-Glass prediction series
- 2010-02-06 13:02:29下载
- 积分：1
-
DigitalImageProcessingExperimentMATLAB
基于视频图像的车牌定位程序，其中预处理包括图像二值化、边缘提取、图像滤波和形态学处理的等等，最后利用投影进行车牌定位。(License Plate Location Based on Video Image program, which includes image binarization pretreatment, edge extraction, image filtering and morphological processing, etc. Finally, projection for license plate location.)
- 2010-07-12 10:41:13下载
- 积分：1
-
application
超分辨率图像重建 包括图像配准 图像重建等方面 非常实用(Super-resolution )
- 2011-05-25 16:01:28下载
- 积分：1
-
hm9
2D particle movement in a circle domain
- 2013-11-16 12:35:05下载
- 积分：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
-
gradephase
采用MATLAB编写的相位编组算法，用于直线的提取，适用于图像灰度梯度较大的情况(MATLAB phase grouping algorithm for linear extraction, apply to the larger gray gradient of)
- 2007-05-25 16:25:31下载
- 积分：1
-
3_DGPlaceOptimImperiCompAlgo
DG Placement optimization in 33-bus and 69-bus distribution power systems using Imperialistic Competition optimization algorithm.
- 2020-11-13 23:39:43下载
- 积分：1
