holtech bar code reader 匯編程序
標(biāo)簽： holtech reader code bar
上傳時間： 2013-12-20
上傳用戶：busterman
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
上傳時間： 2014-01-19
上傳用戶：BIBI
A solution of contest problem in Google Code Jam
標(biāo)簽： solution contest problem Google
上傳時間： 2014-01-24
上傳用戶：zhangliming420
This paper studies the problem of tracking a ballistic object in the reentry phase by processing radar measurements. A suitable (highly nonlinear) model of target motion is developed and the theoretical Cramer—Rao lower bounds (CRLB) of estimation error are derived. The estimation performance (error mean and
標(biāo)簽： processing ballistic the tracking
上傳時間： 2014-10-31
上傳用戶：yyyyyyyyyy
This paper studies the problem of tracking a ballistic object in the reentry phase by processing radar measurements. A suitable (highly nonlinear) model of target motion is developed and the theoretical Cramer—Rao lower bounds (CRLB) of estimation error are derived. The estimation performance (error mean and
標(biāo)簽： processing ballistic the tracking
上傳時間： 2014-01-14
上傳用戶：奇奇奔奔
This paper studies the problem of tracking a ballistic object in the reentry phase by processing radar measurements. A suitable (highly nonlinear) model of target motion is developed and the theoretical Cramer—Rao lower bounds (CRLB) of estimation error are derived. The estimation performance (error mean and
標(biāo)簽： processing ballistic the tracking
上傳時間： 2013-12-22
上傳用戶：asddsd
最長子序列,英文版,電子書 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem
標(biāo)簽： Subsequence Algorithms Longest Problem
上傳時間： 2014-01-27
上傳用戶：zhuimenghuadie
the problem Matlab.pdf 這是個對于初學(xué)者很有用的 希望大家都能學(xué)好matlab
標(biāo)簽： problem Matlab matlab the
上傳時間： 2017-02-08
上傳用戶：王小奇
this can resolve the problem ,which answer the communication such as in opentp one envierment.
標(biāo)簽： communication envierment the resolve
上傳時間： 2014-01-16
上傳用戶：sclyutian
use visual c++ to solve math problem ,Chengbihong,people post pre
標(biāo)簽： Chengbihong problem people visual
上傳時間： 2013-12-20
上傳用戶：hgy9473
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
