3495 search results - page 114 / 699 » On the random satisfiable process |
106
Voted
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
101
Voted
ACSAC
2006
IEEE
15 years 7 months 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...
95
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
97
Voted
OPNETEC
2004
Springer
15 years 6 months ago
2004
Springer
: We consider the routing and the wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength switching mesh network without wavelength conversion functio...
105
click to vote
ACSAC
2003
IEEE
15 years 6 months ago
2003
IEEE
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highl...