118 search results - page 12 / 24 » A phase transition in the random transposition random walk |
111
click to vote
CORR
2004
Springer
15 years 9 days ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
131
Voted
ICST
2010
IEEE
14 years 11 months ago
2010
IEEE
—Markov chains with Labelled Transitions can be used to generate test cases in a model-based approach. These test cases are generated by random walks on the model according to pr...
ANSS
2005
IEEE
15 years 6 months ago
2005
IEEE
The random trip model was recently proposed as a generic mobility model that contains many particular mobility models, including the widely-known random waypoint and random walks,...
102
Voted
COCOON
2006
Springer
15 years 2 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
84
Voted
JSAT
2006
15 years 12 days ago
2006
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...