18 search results - page 2 / 4 » Tractable Planning with State Variables by Exploiting Struct... |
CP
2007
Springer
13 years 11 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
AIPS
2006
13 years 7 months ago
2006
Filtering denotes any method whereby an agent updates its belief state--its knowledge of the state of the world--from a sequence of actions and observations. In logical filtering,...
AIPS
1994
13 years 6 months ago
1994
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
ICDE
2009
IEEE
14 years 10 days ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
AAAI
1997
13 years 6 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...