860 search results - page 50 / 172 » Biased Random Walks |
RSA
2008
13 years 10 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
ICML
2004
IEEE
14 years 11 months ago
2004
IEEE
Classifier learning methods commonly assume that the training data consist of randomly drawn examples from the same distribution as the test examples about which the learned model...
ISQED
2006
IEEE
14 years 5 months ago
2006
IEEE
This paper proposes a novel method for analyzing large onchip power delivery networks via a stochastic moment matching (SMM) method. The proposed method extends the existing direc...
IROS
2008
IEEE
14 years 5 months ago
2008
IEEE
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
TCS
2010
13 years 5 months ago
2010
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...