Sciweavers

971 search results - page 67 / 195
» Approximate Satisfiability and Equivalence
Sort
View
ICMLA
2008
13 years 11 months ago
Prediction-Directed Compression of POMDPs
High dimensionality of belief space in Partially Observable Markov Decision Processes (POMDPs) is one of the major causes that severely restricts the applicability of this model. ...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...
NIPS
2007
13 years 11 months ago
Convex Relaxations of Latent Variable Training
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
Yuhong Guo, Dale Schuurmans
IJCAI
2001
13 years 11 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean
IJAR
2008
74views more  IJAR 2008»
13 years 10 months ago
Unifying practical uncertainty representations - I: Generalized p-boxes
Abstract. There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probabi...
Sébastien Destercke, Didier Dubois, Eric Ch...
LATIN
2004
Springer
14 years 3 months ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl