2005 search results - page 234 / 401 » Decisive Markov Chains |
137
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
136
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
106
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
A model for statistical ranking is a family of probability distributions whose states are orderings of a xed nite set of items. We represent the orderings as maximal chains in a ...
139
click to vote
PE
2011
Springer
14 years 8 months ago
2011
Springer
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
100
click to vote
TIT
2011
14 years 8 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...