Sciweavers

827 search results - page 94 / 166
» The Complexity of Probabilistic Lobbying
Sort
View
ACSD
2008
IEEE
106views Hardware» more  ACSD 2008»
15 years 8 months ago
Time-bounded model checking of infinite-state continuous-time Markov chains
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
Lijun Zhang, Holger Hermanns, Ernst Moritz Hahn, B...
BIOCOMP
2007
15 years 7 months ago
Interaction Models for Biochemical Reactions
Abstract—This paper presents a stochastic modelling framework for complex biochemical reaction networks from a component-based perspective. Our approach takes into account the di...
Mila E. Majster-Cederbaum, Nils Semmelrock, Verena...
AAAI
2006
15 years 7 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
AIPS
2003
15 years 7 months ago
A Framework for Planning in Continuous-time Stochastic Domains
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
Håkan L. S. Younes, David J. Musliner, Reid ...
NIPS
2000
15 years 7 months ago
Discovering Hidden Variables: A Structure-Based Approach
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
Gal Elidan, Noam Lotner, Nir Friedman, Daphne Koll...