Sciweavers

660 search results - page 26 / 132
» Parallel Computer Workload Modeling with Markov Chains
Sort
View
JMLR
2010
88views more  JMLR 2010»
13 years 2 months ago
Inference and Learning in Networks of Queues
Probabilistic models of the performance of computer systems are useful both for predicting system performance in new conditions, and for diagnosing past performance problems. The ...
Charles A. Sutton, Michael I. Jordan
DSN
2005
IEEE
14 years 1 months ago
Lumping Matrix Diagram Representations of Markov Models
Continuous-time Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a space-ef...
Salem Derisavi, Peter Kemper, William H. Sanders
CVPR
2004
IEEE
13 years 11 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
HYBRID
2010
Springer
14 years 2 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
CP
2010
Springer
13 years 6 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman