<rt id="4esms"></rt>
嵌入式linux經(jīng)典教程Embedded Linux Primer A Practical Real-World Approach (Original Edition) 由monta vista linux的開發(fā)者寫的.
標(biāo)簽： Real-World Practical Embedded Approach
上傳時(shí)間： 2014-12-04
上傳用戶：wfl_yy
Proceedings of Practice of Interesting Algorithms 2007 The editor assumes no responsibility for the accuracy, completeness or usefulness of the information disclosed in this volume. Unauthorized use might infringe on privately owned patents of publication right. Please contact the individual authors for permission to reprint or otherwise use information from their papers. First edition 2007 Publication Planned by Prof. Wenxin Li Edited by Yili Zhao All rights reserved by Artificial Intelligence Laboratory, Peking University June 26, 2007
標(biāo)簽： responsibility Proceedings Interesting Algorithms
上傳時(shí)間： 2016-06-28
上傳用戶：wyc199288
一、問題的提出： 某廠根據(jù)計(jì)劃安排，擬將n臺(tái)相同的設(shè)備分配給m個(gè)車間，各車間獲得這種設(shè)備后，可以為國家提供盈利Ci j(i臺(tái)設(shè)備提供給j號(hào)車間將得到的利潤，1≤i≤n，1≤j≤m) 。問如何分配，才使國家得到最大的盈利L 二．算法的基本思想： 利用動(dòng)態(tài)規(guī)劃算法的思想，設(shè)將i臺(tái)設(shè)備分配給j－1個(gè)車間，可以為國家得到最大利潤Li (j-1)(1≤i≤n，1≤j≤m)，那么將這i臺(tái)設(shè)備分配給j個(gè)車間，第j個(gè)車間只能被分配到0～i臺(tái)，所以我們只要算出當(dāng)?shù)趈個(gè)車間分配到t(0<=t<=i)臺(tái)時(shí)提供的最大利潤Lt(j-1)+C(i-t)j，
標(biāo)簽：
上傳時(shí)間： 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)
標(biāo)簽： ClustanGraphics Complete Neighbor Linkage
上傳時(shí)間： 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.
標(biāo)簽： the subsequence determine Instead
上傳時(shí)間： 2013-12-17
上傳用戶：evil
車輛管理系統(tǒng) 開發(fā)說明 程序開發(fā)環(huán)境： Microsoft Windows XP Profresional + Service Pack 2 Microsoft Visual FoxPro 6.0 簡體中文版
標(biāo)簽： Microsoft Profresional Windows Service
上傳時(shí)間： 2017-03-07
上傳用戶：BIBI
詳細(xì)介紹MCL算法，是由Sebastian Thrun a, Dieter Fox, Wolfram Burgard, Frank Dellaert所著的論文，發(fā)表于Artificial Intelligence上。
上傳時(shí)間： 2017-03-26
上傳用戶：朗朗乾坤
MATLAB code to perform Monte Carlo simulation for getting price of an European swaption under the Libor Market Model (LMM) framework.
標(biāo)簽： simulation European swaption perform
上傳時(shí)間： 2014-11-30
上傳用戶：shus521
充電器方案,為SLA，NICd,NiMH和Li-Lon電池設(shè)計(jì)的充電器
上傳時(shí)間： 2013-12-28
上傳用戶：zhouli
哈夫曼樹又稱最優(yōu)二叉樹，是一種帶權(quán)路徑長度最短的二叉樹。所謂樹的帶權(quán)路徑長度，就是樹中所有的葉結(jié)點(diǎn)的權(quán)值乘上其到根結(jié)點(diǎn)的路徑長度（若根結(jié)點(diǎn)為0層，葉結(jié)點(diǎn)到根結(jié)點(diǎn)的路徑長度為葉結(jié)點(diǎn)的層數(shù)）。樹的帶權(quán)路徑長度記為WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N個(gè)權(quán)值Wi(i=1,2,...n)構(gòu)成一棵有N個(gè)葉結(jié)點(diǎn)的二叉樹，相應(yīng)的葉結(jié)點(diǎn)的路徑長度為Li(i=1,2,...n)?？梢宰C明哈夫曼樹的WPL是最小的。
上傳時(shí)間： 2017-06-09
上傳用戶：wang5829
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
