This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2017-05-17
上傳用戶：日光微瀾
This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2017-05-17
上傳用戶：teddysha
This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2013-12-12
上傳用戶：15736969615
This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2013-11-28
上傳用戶：maizezhen
This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2013-11-28
上傳用戶：784533221
This project concentrates on the deterministic approach. This guarantees the full coverage in mobile adhoc network. This uses deterministic broadcast protocols that use neighbor set information only, which is more efficient method.
標簽： This deterministic concentrates guarantees
上傳時間： 2017-05-17
上傳用戶：chens000
非線性方程求根的理論講解，包括Newton s method, The Secant method, Brent s method
上傳時間： 2017-05-21
上傳用戶：zhoujunzhen
Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes
標簽： Generate Possion between random
上傳時間： 2017-05-25
上傳用戶：bibirnovis
This program take a two sequences with differents lengths and transform in two sequences with same length with use zero padding method.
標簽： sequences with differents two
上傳時間： 2017-05-27
上傳用戶：kikye
) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
標簽： code Compression huffman provide
上傳時間： 2017-05-30
上傳用戶：yuchunhai1990
