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

相 關 資 源

主站蜘蛛池模板: 清原| 三亚市| 麻阳| 剑河县| SHOW| 萨嘎县| 宜川县| 韶山市| 个旧市| 比如县| 房产| 探索| 新郑市| 合江县| 三原县| 天气| 内江市| 夏邑县| 怀远县| 仪陇县| 和静县| 株洲县| 嫩江县| 靖边县| 股票| 绥中县| 封开县| 尚义县| 饶阳县| 昌乐县| 南城县| 甘洛县| 稷山县| 平和县| 汨罗市| 黎川县| 黄大仙区| 嘉荫县| 哈密市| 竹山县| 古丈县|