一、问题的提出： 某厂根据计划安排，拟将n台相同的设备分配给m个车间，各车间获得这种设备后，可以为国家提供盈利Ci j(i台设备提供给j号车间将得到的利润，1≤i≤n，1≤j≤m) 。问如何分配，才使国家得到最大的盈利L 二．算法的基本思想： 利用动态规划算法的思想，设将i台设备分配给j－1个车间，可以为国家得到最大利润Li (j-1)(1≤i≤n，1≤j≤m)，那么将这i台设备分配给j个车间，第j个车间只能被分配到0～i台，所以我们只要算出当第j个车间分配到t(0<=t<=i)台时提供的最大利润Lt(j-1)+C(i-t)j，
标签：
上传时间： 2016-09-19
上传用户：希酱大魔王
ClustanGraphics聚类分析工具。提供了11种聚类算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of Squares Flexible (ß space distortion parameter) Density (or k-linkage, density-seeking mode analysis)
标签： ClustanGraphics Complete Neighbor Linkage
上传时间： 2014-01-02
上传用户：003030
Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. The LCS must contain am, we have to find the LCS of a1a2…am-1 and b1b2…bn-1. Case 2: am≠bn. Wehave to find the LCS of a1a2…am-1 and b1b2…bn, and a1a2…am and b b b b1b2…bn-1 Let A = a1 a2 … am and B = b1 b2 … bn Let Li j denote the length of the longest i,g g common subsequence of a1 a2 … ai and b1 b2 … bj. Li,j = Li-1,j-1 + 1 if ai=bj max{ L L } a≠b i-1,j, i,j-1 if ai≠j L0,0 = L0,j = Li,0 = 0 for 1≤i≤m, 1≤j≤n.
标签： the subsequence determine Instead
上传时间： 2013-12-17
上传用户：evil
车辆管理系统 开发说明 程序开发环境： Microsoft Windows XP Profresional + Service Pack 2 Microsoft Visual FoxPro 6.0 简体中文版
标签： Microsoft Profresional Windows Service
上传时间： 2017-03-07
上传用户：BIBI
详细介绍MCL算法，是由Sebastian Thrun a, Dieter Fox, Wolfram Burgard, Frank Dellaert所著的论文，发表于Artificial Intelligence上。
上传时间： 2017-03-26
上传用户：朗朗乾坤
MATLAB code to perform Monte Carlo simulation for getting price of an European swaption under the Libor Market Model (LMM) framework.
标签： simulation European swaption perform
上传时间： 2014-11-30
上传用户：shus521
充电器方案,为SLA，NICd,NiMH和Li-Lon电池设计的充电器
上传时间： 2013-12-28
上传用户：zhouli
哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。
上传时间： 2017-06-09
上传用户：wang5829
VHDL implementation of the twofish cipher for 128,192 and 256 bit keys. The implementation is in library-like form All needed components up to, including the round/key schedule circuits are implemented, giving the flexibility to be combined in different architectures (iterative, rolled out/pipelined etc). Manual in English is included with more details about how to use the components and/or how to optimize some of them. All testbenches are provided (tables, variable key/text, ECB/CBC monte carlo) for 128, 192 and 256 bit key sizes, along with their respective vector files.
标签： implementation twofish cipher VHDL
上传时间： 2017-06-25
上传用户：王小奇
On the implementation and usage of SDPT3 – a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
标签： semidefinite-quadratic-li implementation software package
上传时间： 2014-11-30
上传用户：ayfeixiao
