580 search results - page 48 / 116 » Approximation Algorithms for Temporal Reasoning |
125
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
229
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
126
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...
151
click to vote
ASIAN
2003
Springer
15 years 7 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
112
click to vote
JMLR
2010
14 years 9 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...