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
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as far to the left as possible. The data associated with all descendants of a node are smaller than the datum associated with this node.
標(biāo)簽： tree conditions completely satisfying
上傳時(shí)間： 2014-01-01
上傳用戶：gundan
All of Java s Input/Output (I/O) facilities are based on streams, which provide simple ways to read and write data of different types. Java provides many different kinds of streams, each with its own application. The universe of streams is divided into four large categories: input streams and output streams, for reading and writing binary data and readers and writers, for reading and writing textual (character) data. You re almost certainly familiar with the basic kinds of streams--but did you know that there s a CipherInputStream for reading encrypted data? And a ZipOutputStream for automatically compressing data? Do you know how to use buffered streams effectively to make your I/O operations more efficient? Java I/O, 2nd Edition has been updated for Java 5.0 APIs and tells you all you ever need to know about streams--and probably more.
標(biāo)簽： facilities streams provide Output
上傳時(shí)間： 2013-12-17
上傳用戶：6546544
Introduction Sometimes you may collide with the following problem: a third-party binary component or control embedded into your application displays windows (usually message boxes) that hang your code until they are closed. If you do not have the source code of this binary and one does not have a good API to change one’s bad behaviour programmatically, it can be a real headache using the one. A famous example of such a binary is the WebBrowser control in .NET.
標(biāo)簽： Introduction third-party Sometimes following
上傳時(shí)間： 2013-12-31
上傳用戶：pinksun9
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine students project. You can use and redistribute the source code absolutelly free!
標(biāo)簽： Inserting Searching Postorder Deleting
上傳時(shí)間： 2014-01-25
上傳用戶：蟲蟲蟲蟲蟲蟲
3 simple AVR assembler code to use seven segment display. These 3 codes realy simple way using seven segment display. these are using in my microprocessor classes. Wert deney1.asm -> no scan Wert Deney2.asm -> Scan but BCD Werrt Deney3.asm -> Scan with BCD. By Basri KUL
標(biāo)簽： simple seven assembler segment
上傳時(shí)間： 2017-05-07
上傳用戶：13517191407
Heapsort 1.A heap is a binary tree satisfying the followingconditions: -This tree is completely balanced. -If the height of this binary tree is h, then leaves can be at level h or level h-1. -All leaves at level h are as far to the left as possible. -The data associated with all descendants of a node are smaller than the datum associated with this node. Implementation 1.using a linear array not a binary tree. -The sons of A(h) are A(2h) and A(2h+1). 2.time complexity: O(n log n)
標(biāo)簽： followingconditions tree completely satisfying
上傳時(shí)間： 2017-05-25
上傳用戶：2467478207
demonstrates how to use Delphi with WinLIRC. The source-code is included and there is also a binary file. It runs with Delphi versions 3 through 7. No special components are required.
標(biāo)簽： demonstrates source-code included WinLIRC
上傳時(shí)間： 2014-01-20
上傳用戶：q123321
This program is to find the floating point representation of real number. The user will be asked for the number of mantissa, exponential, and the real number to be calculated (R=10). The program will find the FPR for Hexadecimal (R=16), Octal (R=8), and Binary (R=2).
標(biāo)簽： representation floating program number
上傳時(shí)間： 2017-07-14
上傳用戶：ANRAN
a simple serial to parallel converter using XILLINX and VHDL (the number of the project represents the binary code used by the converter e.g 23- 10111)
標(biāo)簽： represents converter the parallel
上傳時(shí)間： 2013-12-12
上傳用戶：kr770906
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
