5606 search results - page 268 / 1122 » Randomization Techniques for Graphs. |
152
click to vote
WSC
2007
15 years 8 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
149
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
169
click to vote
ACSAC
2006
IEEE
16 years 17 days ago
2006
IEEE
Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the pas...
165
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
135
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...