Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then ...
This paper deals with value (and Q-) function approximation in deterministic Markovian decision processes (MDPs). A general statistical framework based on the Kalman filtering pa...
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
Dengfeng Gao, Christian S. Jensen, Richard T. Snod...