3946 search results - page 387 / 790 » The computational complexity of choice sets |
217
click to vote
AI
2008
Springer
15 years 7 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
216
Voted
IJPRAI
2000
15 years 7 months ago
2000
As Bayesian networks become widely accepted as a normative formalism for diagnosis based on probabilistic knowledge, they are applied to increasingly larger problem domains. These...
219
Voted
CAV
2010
Springer
15 years 5 months ago
2010
Springer
We describe Breach, a Matlab toolbox providing a coherent set of simulation-based techniques aimed at the analysis of deterministic models of hybrid dynamical systems. The primary ...
212
click to vote
ICDAR
2009
IEEE
15 years 5 months ago
2009
IEEE
When selecting features with the sequential forward floating selection (SFFS), the "nesting effect" is avoided, which is a common phenomenon if the computationally less ...
189
click to vote
JMLR
2010
15 years 2 months ago
2010
Collapsed Gibbs sampling is a frequently applied method to approximate intractable integrals in probabilistic generative models such as latent Dirichlet allocation. This sampling ...