3341 search results - page 491 / 669 » On Bounded Queries and Approximation |
153
click to vote
IJCAI
2007
15 years 8 months ago
2007
We consider the fundamental problem of monitoring (i.e. tracking) the belief state in a dynamic system, when the model is only approximately correct and when the initial belief st...
213
click to vote
ACST
2006
15 years 8 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
129
click to vote
NIPS
2004
15 years 8 months ago
2004
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
182
click to vote
UAI
2001
15 years 8 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
164
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We consider a fault-tolerant generalization of the classical uncapacitated facility location problem, where each client j has a requirement that rj distinct facilities serve it, i...