1204 search results - page 139 / 241 » Hybrid Probabilistic Programs |
90
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
188
Voted
MOZ
2004
Springer
15 years 6 months ago
2004
Springer
We present the design and implementation of a Minesweeper game, augmented with a digital assistant. The assistant uses contraint programming techniques to help the player, and is a...
92
Voted
IJCAI
2007
15 years 2 months ago
2007
In this paper we prove that the well-known correspondence between the forward-backward algorithm for hidden Markov models (HMMs) and belief propagation (BP) applied to HMMs can be...
101
Voted
BMCBI
2002
15 years 19 days ago
2002
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
155
click to vote
CPAIOR
2010
Springer
14 years 10 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...