登录
首页 » matlab » topsis_1.0

topsis_1.0

于 2013-11-26 发布 文件大小:10KB
0 260
下载积分: 1 下载次数: 24

代码说明:

  A topsis-fuzzy aligorithm to solve multi criteria decision making in an organisation

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

发表评论

0 个回复

  • noupao
    采用累计贡献率的方法,包括AHP,因子分析,回归分析,聚类分析,直线阵采用切比学夫加权控制主旁瓣比。( The method of cumulative contribution rate Including AHP, factor analysis, regression analysis, cluster analysis, Linear array using cut than learning laid upon the right control of the main sidelobe ratio.)
    2016-06-04 13:45:11下载
    积分:1
  • Mature_image_3
    It describes a stage of cotton flower whether it is matured or not.
    2013-11-24 17:12:42下载
    积分:1
  • vr
    说明:  混沌工具function [dlogCr,dlogr,dlogCrCI]=vr(logCr,logr,alpha)(function [dlogCr,dlogr,dlogCrCI]=vr(logCr,logr,alpha))
    2010-04-25 23:58:45下载
    积分:1
  • 199398d0e981
    matlab explains merging of snakes
    2013-04-20 15:46:40下载
    积分:1
  • matlab-matlab-function
    matlab 函数大全 包含matlab中用到的所有函数及其用法(Encyclopedia contains matlab matlab function used in all functions and their usage)
    2021-02-21 09:29:42下载
    积分:1
  • 演示程序一维搜索
    说明:  对二杆桁架静力分析,一维搜索的matlab演示程序。(of two truss static analysis, one-dimensional search Matlab demo program.)
    2005-12-06 08:56:39下载
    积分:1
  • USE-OF-GA-BP
    GA-BP 可 以 用 来 做 很 多 事 情(USE OF GA-BP)
    2012-05-05 10:04:38下载
    积分:1
  • matpower4.1
    Matpower4.1:潮流计算与最优潮流(Matpower: flow calculation and optimal power flow)
    2013-11-06 17:40:23下载
    积分:1
  • DTW
    DTW算法的程序,申请两个n*m的矩阵D、d,分别为累积距离和帧匹配距离。这里n和m为测试模版与参考模版的帧数。然后通过一个循环计算两个模版的帧匹配距离d。接下来进行动态规划,为每个格点 (i,j)都计算其三个可能的前续格点的累积距离D1,D2,D3。考虑到边界问题,有些前续格点可能不存在,因此加入一些判断条件最后利用最小值函数min(),找到三个前续格点的累积 距离作为累积距离,与当前帧的匹配距离d(i,j)相加,作为当前格点的累积距离。该计算过程一直达到格点(n,m),并将D(n,m)输出,作为模版匹配的结果。(DTW algorithm procedures, apply two n* m matrix D, d, respectively, accumulated distance and frame matching distance. Where n and m is a reference test pattern and the template frames. Then through a loop to calculate two frames template matching distance d. Next, dynamic programming, for each grid point (i, j) are calculated from the cumulative D1 before the renewal of its three possible lattice point, D2, D3. Taking into account the boundary problem, some former continued grid point may not exist, so add some conditions to determine the final use of the minimum function min (), found three former continued accumulation of grid points cumulative distance as the distance from the current frame to match the d (i, j) added, and a current cumulative distance grid. This calculation has reached the grid (n, m), and D (n, m) output, as a result of template matching.)
    2014-05-05 14:30:21下载
    积分:1
  • cpmequ_linear
    CPM调制的线性均衡器,使用维特比判决器进行判决。(CPM modulation linear equalizer, the use of Viterbi browser sentencing verdict.)
    2007-08-03 15:13:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载