搜索资源列表
bigint
- for use in the far distant future, convert a packed field to a large integer. Does a simple expansion. The large integer is 4 times bigger to accomodate multiplication (once!).-for use in the far distant future, convert a packed field to a larg
ControlOptimization
- In this paper it is studied the modeling and control of a robotic bird. The results are positive for the design and construction of flying robots and a new generation of airplanes developed to the similarity of flying animals. The development of comp
[10]Minimum_cost_configuration_of_relay_and_chann
- Fixed broadband wireless access is a promising technology allowing Internet service providers to expend their customer base in sparsely populated rural areas. Because the size of the target service area is humongous, relay in- frastructure is e
modified-booth-algorithm
- this document describe method of binary multiplication of signed and unsigned integer. it represent also the booth algorithm wich compounded with shift and adder blocks this optimise the comsumption of the alu
ree
- 应用整数小波变换的抗盲检测图像隐写 -Application of anti-Blind integer wavelet transform image steganography application detection integer wavelet transform image steganography detection of anti-Blind
TheseVERVISCH-PICOIS
- Indoor positionnig,(thesis in french) problems related ton the near-far, integer ambiguity resolution and multipath problem
04470099.rar
- A semi blind technique for estimating the carrier frequency offset in OFDM communication systems is presented in this paper. The fractional and integer frequency offsets are esti-mated by employing a few null subcarriers in the rst OFDM sy
jos
- he value of tag could be set to any integer between 1 and 14 which correspods to the trial number of subject
Bilevel-approach-for-optimal
- 在最佳位置和合同双层办法 分布式发电的径向分布定价 使用混合整数线性规划系统-Bilevel approach for optimal location and contract pricing of distributed generation in radial distribution systems using mixed-integer linear programming
find-sum
- 1. Find Sum. Given a set of n integers (in sorted order) and another integer x. The algorithm has been designed that verifies whether there exist pairs of integers a and b such that a + b = x, Algorithm should output all such pair o
stein.nb
- returns the product of all positive integers less than or equal to n , where n is a nonnegative integer value. If n is an array, then f contains the