Sciweavers

580 search results - page 23 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
EAAI
2008
111views more  EAAI 2008»
15 years 2 months ago
Fuzzy conditional temporal problems: Strong and weak consistency
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
Marco Falda, Francesca Rossi, Kristen Brent Venabl...
NIPS
2008
15 years 3 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
LOGCOM
1998
178views more  LOGCOM 1998»
15 years 2 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
TIME
2006
IEEE
15 years 8 months ago
k-Anonymity in Databases with Timestamped Data
In this paper we extend the notion of k-anonymity in the context of databases with timestamped information in order to naturally define k-anonymous views of temporal data. We als...
Sergio Mascetti, Claudio Bettini, Xiaoyang Sean Wa...
JACM
2010
116views more  JACM 2010»
15 years 24 days ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára