亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

您現在的位置是:蟲蟲下載站 > 資源下載 > 其他書籍 > The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no

The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some no

資 源 簡 介

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

相 關 資 源

主站蜘蛛池模板: 邯郸县| 剑川县| 海原县| 曲沃县| 育儿| 江孜县| 河北区| 苍梧县| 太仆寺旗| 乌兰察布市| 县级市| 方城县| 镇雄县| 桃园县| 阳信县| 武功县| 济南市| 乌鲁木齐县| 牡丹江市| 鲜城| 岫岩| 赤壁市| 沛县| 精河县| 台安县| 翁牛特旗| 阳春市| 彭州市| 莱西市| 盐津县| 固镇县| 浑源县| 西乌珠穆沁旗| 新野县| 双峰县| 周口市| 宿州市| 沙河市| 东兴市| 贡觉县| 云龙县|