亚洲欧美第一页_禁久久精品乱码_粉嫩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

相 關 資 源

主站蜘蛛池模板: 永昌县| 正安县| 佛教| 东光县| 十堰市| 柏乡县| 囊谦县| 莲花县| 富源县| 视频| 三江| 绥德县| 扬中市| 定远县| 芷江| 临猗县| 浦县| 石棉县| 谢通门县| 泰顺县| 灵川县| 科技| 成安县| 阿克陶县| 南投市| 高要市| 南开区| 习水县| 屏山县| 山东省| 定兴县| 上虞市| 剑河县| 会理县| 沂水县| 衡阳县| 开江县| 安达市| 富源县| 庐江县| 青岛市|