239 search results - page 8 / 48 » Passage time distributions in large Markov chains |
CIKM
2004
Springer
14 years 15 days ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
CAV
2009
Springer
14 years 7 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
ICDIM
2007
IEEE
13 years 9 months ago
2007
IEEE
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
ACSD
2008
IEEE
13 years 9 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...