登录
首页 » matlab » resourcemapping

resourcemapping

于 2011-04-27 发布 文件大小:1KB
0 271
下载积分: 1 下载次数: 12

代码说明:

  TD-LTE PMCH matlab source code

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • PCA
    主成份分析, matlab源代码, PCA 算法。(The principal component analysis, Matlab source code, PCA algorithm.)
    2013-03-09 12:45:59下载
    积分:1
  • 2012MATLAB__test
    matlab的实验指导书,轻松帮助您入门(matlab experiment instructions, easy to help you get started)
    2012-09-03 15:43:00下载
    积分:1
  • canshu_xianpu
    给出了谱估计中参数估计的线谱的估计模型的程序带码(PSD line )
    2012-11-25 20:19:07下载
    积分:1
  • MyMUSIC
    说明:  MUSIC方法计算DOA的子程序,各种输入参数及输出参数都有说明。(MUSIC DOA subroutine method, a variety of input parameters and output parameters have the instructions.)
    2011-04-12 17:00:45下载
    积分:1
  • fuzzy1
    说明:  基于模糊贴近度的数据融合新算法 matlab源程序(Based on fuzzy close-degree of data fusion new algorithm matlab source)
    2008-12-08 17:33:37下载
    积分:1
  • Desktop
    人脸定位代码,短小但精度和速度都很高,matlab版本不能太低(Face location code, a short but very high accuracy and speed,)
    2013-12-15 09:58:19下载
    积分:1
  • matlabFEKO
    MATLAB调用FEKO计算电场,可更改参数,读取计算结果(MATLAB to call FEKO to calculate the electric field.It can change the parameters and read the calculated results)
    2021-04-20 16:48:50下载
    积分:1
  • Weight_W2
    Quartic Spline weight function from "An Introduction to Meshfree Methods and Their Programming [G.R. Liu, Y.T. Gu] " the orginal code is in fortran but this code is in matlab
    2013-08-18 13:48:16下载
    积分: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
  • power
    matlab 离散序列FFT求平均周期程序(matlab discrete FFT sequence of procedures for the average cycle)
    2009-07-16 18:00:28下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载