3820 search results - page 187 / 764 » Bounded Model Debugging |
110
click to vote
TACAS
2007
Springer
15 years 9 months ago
2007
Springer
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...
135
Voted
NIPS
2008
15 years 4 months ago
2008
We present a simple new Monte Carlo algorithm for evaluating probabilities of observations in complex latent variable models, such as Deep Belief Networks. While the method is bas...
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total...
132
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
144
click to vote
TIT
2010
14 years 10 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...