480 search results - page 79 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
CAV
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
JAIR
2006
13 years 7 months ago
2006
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
UAI
2001
13 years 9 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...