160 search results - page 27 / 32 » Definition and Complexity of Some Basic Metareasoning Proble... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
RV
2010
Springer
13 years 5 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, a novel method to learn the intrinsic object structure for robust visual tracking is proposed. The basic assumption is that the parameterized object state lies on a...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
SMC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Reinforcement learning is a framework in which an agent can learn behavior without knowledge on a task or an environment by exploration and exploitation. Striking a balance betw...