holtech bar code reader 汇编程序
上传时间： 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
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
A solution of contest problem in Google Code Jam
标签： 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
标签： 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
标签： 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
标签： processing ballistic the tracking
上传时间： 2013-12-22
上传用户：asddsd
最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem
标签： Subsequence Algorithms Longest Problem
上传时间： 2014-01-27
上传用户：zhuimenghuadie
the problem Matlab.pdf 这是个对于初学者很有用的 希望大家都能学好matlab
上传时间： 2017-02-08
上传用户：王小奇
this can resolve the problem ,which answer the communication such as in opentp one envierment.
标签： communication envierment the resolve
上传时间： 2014-01-16
上传用户：sclyutian
use visual c++ to solve math problem ,Chengbihong,people post pre
标签： Chengbihong problem people visual
上传时间： 2013-12-20
上传用户：hgy9473
