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
this procedure is simulated document management system disk space management, Disk Management, directory management (single-level directory) of a simulation program, as well as university computer courses on operating system design a case, we only reference
標(biāo)簽： management Management procedure simulated
上傳時(shí)間： 2017-02-05
上傳用戶：zhuoying119
Description: Microsoft?Windows?HTTP Services (WinHTTP) provides developers with a server-supported, high-level interface to the HTTP/1.1 Internet protocol. WinHTTP is designed to be used primarily in server-based scenarios by server applications that communicate with HTTP servers. WinHTTP is also designed for use in system services and HTTP-based client applications. WinHTTP is more secure and robust than WinInet. However, single-user applications that need FTP or gopher functionality, cookie persistence, caching, automatic credential dialog handling, Internet Explorer compatibility, or downlevel platform support should still consider using WinInet.
標(biāo)簽： server-supported Description developers Microsoft
上傳時(shí)間： 2017-02-07
上傳用戶：refent
VC技術(shù)內(nèi)幕第五版,學(xué)習(xí)VC經(jīng)典書籍 The 6.0 release of Visual C++ shows Microsoft s continued focus on Internet technologies and COM, which are key components of the new Windows Distributed interNet Application Architecture (DNA). In addition to supporting these platform initiatives, Visual C++ 6.0 also adds an amazing number of productivity-boosting features such as Edit And Continue, IntelliSense, AutoComplete, and code tips. These features take Visual C++ to a new level. We have tried to make sure that this book keeps you up to speed on the latest technologies being introduced into Visual C++.
標(biāo)簽： Microsoft continued Internet release
上傳時(shí)間： 2013-12-14
上傳用戶：ve3344
These are P-Channel enhancement mode silicon gate power fi eld effect transistors. They are advanced power MOSFETs designed, tested, and guaranteed to withstand a specifi ed level of energy in the breakdown avalanche mode of operation. All of these power MOSFETs are designed for applications such as switching regulators, switching converters, motor drivers, relay drivers and drivers for other high-power switching devices. The high input impedance allows these types to be operated directly from integrated circuits.
標(biāo)簽： enhancement transistors P-Channel are
上傳時(shí)間： 2017-02-17
上傳用戶：aeiouetla
What is Verilog? ➥ Verilog HDL is a Hardware Description Language (HDL) ➥ Verilog HDL allows describe designs at a high level of abstraction as well as the lower implementation levels ➥ Primary use of HDLs is the simulation of designs ➥ Verilog is a discrete event time simulator What is VeriWell? ➥ VeriWell is a comprehensive implementation of Verilog HDL
標(biāo)簽： Verilog HDL 10149 Description
上傳時(shí)間： 2017-02-18
上傳用戶：
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
自己寫的robocup-2d程序，從UVA改編 This method is the first complete simple team and defines the actions taken by all the players on the field (excluding the goalie). It is based on the high-level actions taken by the simple team FC Portugal that it released in 2000.
上傳時(shí)間： 2014-01-27
上傳用戶：上善若水
There are three ways of specifying an immediate dump Immediate dumps can be specified using the ALTER SESSION command ALTER SESSION SET EVENTS immediate trace name dump level level Immediate dumps can be specified in ORADEBUG ORADEBUG DUMP dump level
標(biāo)簽： specifying Immediate immediate specified
上傳時(shí)間： 2014-01-17
上傳用戶：mpquest
The Software Engineering Institute’s (SEI) Capability Maturity Model (CMM) provides a well-known benchmark of software process maturity. The CMM has become a popular vehicle for assessing the maturity of an organization’s software process in many domains. This white paper describes how the Rational Unified Process can support an organization that is trying to achieve CMM Level-2, Repeatable, and Level-3, Defined, software process maturity levels.
標(biāo)簽： Engineering Capability well-known Institute
上傳時(shí)間： 2017-02-27
上傳用戶：zhichenglu
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
