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
Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
標簽： telecommunication represent messages Huffman
上傳時間： 2014-01-04
上傳用戶：x4587
讀取XML信息，顯示在tree上。并且提供各種控制功能
上傳時間： 2013-12-19
上傳用戶：gououo
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
標簽： implementation double-array representing structure
上傳時間： 2013-12-10
上傳用戶：shinesyh
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
標簽： distinct elements fenwick number
上傳時間： 2014-01-20
上傳用戶：lhw888
自己編的，在VB中實現普里姆最小生成樹算法的代碼，有圖的，邊的權值是隨機生成的，5個節點，點“generate tree”，就會顯示出最小樹。
標簽：
上傳時間： 2017-04-09
上傳用戶：Andy123456
一個簡單的Ext例子，里面有Ext.grid.GridPanel和Ext.tree.TreePanel等Ext常用控件的使用，以及Ext和后臺的交互
標簽： Ext
上傳時間： 2013-12-23
上傳用戶：qweqweqwe
伸展樹，基本數據結構，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
ZigBee路由協議指的是ZigBee規范中規定的與路由相關的功能和算法部分，主要包括不同網絡拓撲結構下ZigBee協議數據單元的路由方式、路由發現和路由維護等內容。為了達到低成本、低功耗、可靠性高等設計目標，ZigBee網絡采用了Cluster-Tree與AODV路由相結合的路由算法。該包實現了ZIGBEE路由算法在NS2下的模擬
上傳時間： 2017-05-14
上傳用戶：WMC_geophy
一個實現struts+spring+hebernate的例子，外加一個JavaScript實現的tree的都OK了。
上傳時間： 2013-11-25
上傳用戶：skhlm
