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

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

combinatorial

  • 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

    標簽: combinatorial assignment problem arises

    上傳時間: 2014-01-19

    上傳用戶:BIBI

  • combinatorial Preconditioners Solvers

    combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing

    標簽: image processing

    上傳時間: 2016-03-28

    上傳用戶:hzcloudy

主站蜘蛛池模板: 建德市| 广灵县| 乌兰县| 丰台区| 敦化市| 南澳县| 承德市| 贵港市| 东光县| 临高县| 二连浩特市| 孟津县| 武平县| 晋宁县| 赤壁市| 清河县| 万年县| 石河子市| 剑川县| 盘山县| 女性| 蕲春县| 崇左市| 邢台县| 东光县| 外汇| 夏邑县| 汝州市| 云安县| 青神县| 安达市| 同仁县| 怀化市| 淳安县| 玉树县| 文水县| 雷州市| 安丘市| 三台县| 中西区| 晋中市|