554 search results - page 81 / 111 » Approximate Probabilistic Model Checking |
NIPS
2004
13 years 9 months ago
2004
Schema learning is a way to discover probabilistic, constructivist, predictive action models (schemas) from experience. It includes methods for finding and using hidden state to m...
IJCAI
1989
13 years 8 months ago
1989
In designing autonomous agents that deal competently with issues involving time and space, there is a tradeoff to be made between guaranteed response-time reactions on the one han...
ICTIR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. An open challenge in information distillation is the evaluation and optimization of the utility of ranked lists with respect to flexible user interactions over multiple ...
AUTOMATICA
2005
13 years 7 months ago
2005
Model predictive control (MPC) is of interest because it is one of the few control design methods which preserves standard design variables and yet handles constraints. MPC is nor...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...