4007 search results - page 270 / 802 » Computation with imprecise probabilities |
127
Voted
AAAI
1997
15 years 5 months ago
1997
In this paper, we propose a stochastic version of a general purpose functional programming language as a method of modeling stochastic processes. The language contains random choi...
148
click to vote
DCG
2008
15 years 4 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
144
click to vote
JMLR
2006
15 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
141
click to vote
CPC
2004
15 years 4 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
143
click to vote
MFCS
2010
Springer
15 years 2 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...