242 search results - page 33 / 49 » Distributed algorithms with dynamical random transitions |
111
click to vote
APPROX
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
130
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
136
click to vote
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
ATAL
2009
Springer
15 years 25 days ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
SIGIR
2009
ACM
15 years 6 months ago
2009
ACM
Documents in many corpora, such as digital libraries and webpages, contain both content and link information. To explicitly consider the document relations represented by links, i...