Sciweavers

3257 search results - page 107 / 652
» Some Results on Effective Randomness
Sort
View
AIED
2009
Springer
15 years 4 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
ISSTA
2006
ACM
15 years 3 months ago
An empirical study of the robustness of MacOS applications using random testing
We report on the fourth in a series of studies on the reliability of application programs in the face of random input. Over the previous 15 years, we have studied the reliability ...
Barton P. Miller, Gregory Cooksey, Fredrick Moore
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
TVCG
2011
136views more  TVCG 2011»
14 years 4 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai