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

主站蜘蛛池模板: 昌黎县| 红安县| 鸡西市| 嘉祥县| 垣曲县| 永安市| 左权县| 晋江市| 天台县| 仙游县| 乳山市| 郯城县| 福清市| 礼泉县| 于田县| 孟州市| 辽宁省| 灵武市| 松潘县| 临安市| 定州市| 蕲春县| 鹤峰县| 荣昌县| 姚安县| 包头市| 商丘市| 安吉县| 邵阳县| 宁波市| 翁源县| 呼和浩特市| 天峻县| 揭西县| 杭锦旗| 上虞市| 富锦市| 即墨市| 策勒县| 钟山县| 阿克陶县|