假設(shè)在時(shí)間段[A, B]期間有6個(gè)作業(yè)需要在某臺(tái)機(jī)器上處理，每個(gè)作業(yè)對(duì)應(yīng)的權(quán)重為Wi，請(qǐng)?jiān)O(shè)計(jì)一個(gè)算法使這臺(tái)機(jī)器在該時(shí)間段內(nèi)利用率最高。
標(biāo)簽： 機(jī)器
上傳時(shí)間： 2014-01-10
上傳用戶：gut1234567
OFDM simulation with 16QAM with AWGN and multipath channel model.It can help you to develope your algorithm initially.
標(biāo)簽： with simulation multipath develope
上傳時(shí)間： 2013-12-28
上傳用戶：qw12
The source codes are from the "Simulation and software Radio for mobile communication" It contain the channel model and CDMA Transmitter and receiver.
標(biāo)簽： communication Simulation software contain
上傳時(shí)間： 2016-08-06
上傳用戶：z754970244
The source codes are from the "Simulation and software Radio for mobile communication" It contain the channel model and Cellur handsahacking or the other algorithm.
標(biāo)簽： communication Simulation software contain
上傳時(shí)間： 2016-08-06
上傳用戶：13517191407
The source codes are from the "Simulation and software Radio for mobile communication" It contain the MAC level protocol algorithm.
標(biāo)簽： communication Simulation software contain
上傳時(shí)間： 2016-08-06
上傳用戶：tuilp1a
The task of clustering Web sessions is to group Web sessions based on similarity and consists of maximizing the intra- group similarity while minimizing the inter-group similarity． The first and foremost question needed to be considered in clustering W b sessions is how to measure the similarity between Web sessions．However．there are many shortcomings in traditiona1 measurements．This paper introduces a new method for measuring similarities between Web pages that takes into account not only the URL but also the viewing time of the visited web page．Yhen we give a new method to measure the similarity of Web sessions using sequence alignment and the similarity of W eb page access in detail Experiments have proved that our method is valid and e幣cient．
標(biāo)簽： sessions clustering similarity Web
上傳時(shí)間： 2014-01-11
上傳用戶：songrui
匯編語(yǔ)言編寫的演奏聲音程序,有四個(gè)選擇,A B C 分別是三首不同的曲子,Q退出
上傳時(shí)間： 2014-02-15
上傳用戶：時(shí)代電子小智
輕易學(xué)好C++編程技巧 - 進(jìn)楷 (香港科技大學(xué)筆記 19課) 內(nèi)容包括 1) base C++ review, 2) Pointers and Dynamic Objects, 3) Recursion,Linked Lists, 4) Stacks and Queues, 5) Algorithm Analysis, 6) Insertion Sort and Mergesort, 7) Quicksort, 8) Heaps and Heapsort, 9) Lower Bound of Sorting and Radix Sort, 10) Binary Trees and Binary Search Trees 11) AVL Trees, 12) B+ Trees 13) Graphs and Breadth-First Search 14) Depth-First Search 15) Connected Components, Directed Graphs, 16) Topological Sort 17) Hashing 18) Pattern Matching 19) Additional Review
標(biāo)簽： Pointers Dynamic Objects review
上傳時(shí)間： 2014-10-10
上傳用戶：chfanjiang
圖書管理系統(tǒng) C**實(shí)現(xiàn)的 包括B樹 可以參考一下呀 有需要聯(lián)系我哈
上傳時(shí)間： 2014-12-01
上傳用戶：2525775
高斯－塞德爾迭代法算法： 設(shè)方程組AX=b 的系數(shù)矩陣的對(duì)角線元素 ，M為迭代次數(shù)容許的最大值， 為容許誤差。 ① 取初始向量 ，令k=0 ② 對(duì) 計(jì)算 ③ 如果 ，則輸出 ，結(jié)束；否則執(zhí)行④， ④ 如果 ，則不收斂，終止程序；否則 ，轉(zhuǎn)②。
上傳時(shí)間： 2014-01-22
上傳用戶：集美慧
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
