511 search results - page 5 / 103 » Lower bounds for distributed markov chain problems |
JCO
2008
13 years 7 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
MASCOTS
2007
13 years 9 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
CDC
2009
IEEE
13 years 11 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
DM
2006
13 years 7 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...