1120 search results - page 146 / 224 » Eager Markov Chains |
NAACL
2010
14 years 9 months ago
2010
Adaptor grammars extend probabilistic context-free grammars to define prior distributions over trees with "rich get richer" dynamics. Inference for adaptor grammars seek...
102
click to vote
QEST
2010
IEEE
14 years 9 months ago
2010
IEEE
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
GLOBECOM
2009
IEEE
14 years 9 months ago
2009
IEEE
Performance modeling is important for the purpose of developing efficient dimensioning tools for large complicated networks. But it is difficult to achieve in heterogeneous wireles...
123
Voted
CORR
2010
Springer
14 years 8 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...
116
click to vote
CDC
2010
IEEE
14 years 6 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. ...