The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
You will recieve a Standard Grade for completion of this Extra credit will be given for a more creative approach to the problem, either minimum amount of code, an additional display of seating beyond just the boarding pass, etc
標簽： will completion for Standard
上傳時間： 2014-01-02
上傳用戶：dongqiangqiang
伸展樹，基本數據結構，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.
標簽： 樹
上傳時間： 2017-05-07
上傳用戶：JIUSHICHEN
This file is a function under matlab which allow to compute several statistical parameter of random signal such as variance, power, mean values, std, ...
標簽： statistical parameter function compute
上傳時間： 2017-06-27
上傳用戶：ruixue198909
Mastering the Requirements Process, Second Edition, sets out an industry-proven process for gathering and verifying requirements with an eye toward today s agile development environments. In this total update of the bestselling guide, the authors show how to discover precisely what the customer wants and needs while doing the minimum requirements work according to the project s level of agility.
標簽： industry-proven Requirements Mastering gatherin
上傳時間： 2013-12-08
上傳用戶：璇珠官人
This book’s primary goal is to help you prepare to take and pass Microsoft’s exam number 70-290, Managing and Maintaining a Microsoft Windows Server 2003 Environment. Our secondary purpose in writing this book is to provide exam candidates with knowledge and skills that go beyond the minimum requirements for passing the exam, and help to prepare them to work in the real world of Microsoft computer networking.
標簽： Microsoft primary prepare number
上傳時間： 2014-03-11
上傳用戶：D&L37
Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000. Output: The output is a single line for each case, with the corresponding minimum size cut. Example: Input: 7 11 1 2 3 1 4 3 2 3 4 3 1 3 3 4 1 3 5 2 4 6 6 4 5 2 5 2 1 5 7 1 6 7 9 Output: 5
標簽： Implementation calculates algorithm Edmonds
上傳時間： 2014-01-04
上傳用戶：kiklkook
Analysis of GPS data frame The design of the following four main data collection format: GPGGA (location information), GPRMC (Recommended Minimum location information), GPVTG (ground speed information), PGRME (forecast error message)
標簽： data collection following Analysis
上傳時間： 2017-09-25
上傳用戶：onewq
利用aiNet執行資源聚類的算法分為兩部分：第一部分是aiNet學習算法，如上所述；第二部分是在獲得記憶細胞矩陣M和Ab-Ab之間的dij矩陣S基礎上，實現連通圖的剪枝聚類。 定義 1 無向連通圖G：在形態空間Sw上，以M中抗體對應的點為G的頂點，每對抗體之間的親和力dij為G中兩點連接邊的權值。 定義2 最小生成樹：包含連通圖G中所有頂點的一個子圖稱為G的一棵生成樹T。生成樹中所用邊的權值為生成樹的權。權最小的生成樹定義為最小生成樹(Minimum spanning tree，MST)。
上傳時間： 2015-05-12
上傳用戶：weizhuofu
<sup id="kkeqk"></sup>
<samp id="kkeqk"></samp> <sup id="kkeqk"></sup>