160 search results - page 23 / 32 » Definition and Complexity of Some Basic Metareasoning Proble... |
COR
2008
13 years 7 months ago
2008
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
JCT
2008
13 years 7 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
JAPLL
2008
13 years 7 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...