932 search results - page 60 / 187 » Uniform Random Number Generators |
EMSOFT
2005
Springer
15 years 3 months ago
2005
Springer
Interrupt-driven embedded software is hard to thoroughly test since it usually contains a very large number of executable paths. Developers can test more of these paths using rand...
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Particle swarm optimization (PSO) is a new evolutionary computation technique. Although PSO algorithm possesses many attractive properties, the methods of selecting inert...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
TIT
2008
14 years 9 months ago
2008
In this correspondence, we show that the uniform throughput capacity of an ultra-wideband (UWB) power-constrained ad hoc network is given by 2(P ( n=logn) ), where P is the per-nod...