4451 search results - page 214 / 891 » On Random Ordering Constraints |
203
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
NAND flash-based solid state drives have emerged as revolutionary storage media during recent years. However, the wide-spread of SSD technology is currently obstructed by the fac...
181
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
156
click to vote
EJC
2007
15 years 6 months ago
2007
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
213
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
178
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...