Sciweavers

286 search results - page 29 / 58
» A Markov Chain Model of the B-Cell Algorithm
Sort
View
NIPS
2003
13 years 9 months ago
An MCMC-Based Method of Comparing Connectionist Models in Cognitive Science
Despite the popularity of connectionist models in cognitive science, their performance can often be difficult to evaluate. Inspired by the geometric approach to statistical model ...
Woojae Kim, Daniel J. Navarro, Mark A. Pitt, In Ja...
FORMATS
2006
Springer
13 years 11 months ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
VTC
2010
IEEE
163views Communications» more  VTC 2010»
13 years 5 months ago
An ARQ Mechanism with Rate Control for Two-Hop Relaying Systems
— Wireless multi-hop relaying has been attracting considerable attention as a promising technique for future communication systems. The multi-hop relaying technique has many bene...
Soo-Yong Jeon, Dong-Ho Cho
JMLR
2012
11 years 10 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 1 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen