登录
首页 » Visual C++ » 层次分析法

层次分析法

于 2019-04-18 发布 文件大小:9KB
0 199
下载积分: 1 下载次数: 3

代码说明:

  通过使用matlab,对层次分析法进行求解,从而进一步确定权重,更快的解决问题。(By using matlab, the analytic hierarchy process (AHP) is solved to further determine the weight and solve the problem more quickly.)

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

发表评论

0 个回复

  • HHT
    这是我上传的两篇关于HHT应用和HHT局限性的文章,上传出来大家一起看看啊(This is my upload HHT about two applications and the limitations of article HHT, upload them to see if everybody ah)
    2009-03-13 16:57:30下载
    积分:1
  • ArduCopter
    apm开源飞控,供无人机飞行器的爱好者研究(APM source control, for lovers of unmanned aircraft )
    2014-09-12 17:59:28下载
    积分:1
  • Caverage
    c均值算法用vc实现。作为重要的算法,c均值有广泛的应用(c-means algorithm by vc realize. As an important algorithm, c the mean has a wide range of applications)
    2008-06-01 13:05:25下载
    积分:1
  • enlarge
    对二维图片进行中心放大,能控制放大的倍数,采用最近邻法(enlarge pictures from the center of it,can control the index for enlargement)
    2014-01-07 11:26:28下载
    积分:1
  • matlab7dll
    vc与matlab7的混编,采用的混编方式是通过shared(vc matlab7 with the mixing of the way through the air shared)
    2005-05-01 23:58:30下载
    积分:1
  • lungbayesdemo
    在matlab软件上模拟肺肿瘤生长,吸烟是诱发肺肿瘤的主要原因。(Matlab software to simulate the growth of lung cancer, lung cancer induced by smoking is the main reason.)
    2010-11-17 12:21:07下载
    积分:1
  • 16QAM
    matlab ofam 16qam 信道仿真(matlab ofam 16qam )
    2010-05-10 16:14:58下载
    积分:1
  • Uzcmmgzips
    使用matlab程序源码读取迷宫图象文件,并进行处理,成功走出了迷迷宫.此程序源码只能准确绘出只有一条路径的任意复杂迷宫 可直接使用。 (Matlab program source code to read the maze of image files, and processed successfully out of the fans maze. This program source code can only be accurately drawn to a path of arbitrary complex maze can be used directly.)
    2012-06-09 08:52:09下载
    积分:1
  • pencil
    Elementary graphics editing.Sources MFC application that was created in VIsual C ++. Run the program and draw the strip.
    2014-10-01 16:43:49下载
    积分:1
  • beibaowenti
    有N件物品和一个容量为V的背包。第i件物品的费用是c,价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
    2009-05-07 22:10:10下载
    积分:1
  • 696516资源总数
  • 106554会员总数
  • 12今日下载