Sciweavers

118 search results - page 12 / 24
» A phase transition in the random transposition random walk
Sort
View
CORR
2004
Springer
118views Education» more  CORR 2004»
13 years 8 months ago
Understanding Search Trees via Statistical Physics
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...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
ICST
2010
IEEE
13 years 7 months ago
Generating Transition Probabilities for Automatic Model-Based Test Generation
—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...
Abderrahmane Feliachi, Hélène Le Gue...
ANSS
2005
IEEE
14 years 2 months ago
Perfect Simulations for Random Trip Mobility Models
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,...
Santashil PalChaudhuri, Jean-Yves Le Boudec, Milan...
COCOON
2006
Springer
13 years 10 months ago
Creation and Growth of Components in a Random Hypergraph Process
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...
Vlady Ravelomanana, Alphonse Laza Rijamamy
JSAT
2006
69views more  JSAT 2006»
13 years 8 months ago
The SAT 2005 Solver Competition on Random Instances
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...
Oliver Kullmann