1089 search results - page 38 / 218 » Randomness and Reducibility |
CP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
IJNSEC
2006
13 years 9 months ago
2006
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier ...
IOR
2008
13 years 9 months ago
2008
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
CN
2010
13 years 5 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...