580 search results - page 40 / 116 » Approximation Algorithms for Temporal Reasoning |
142
click to vote
SAGT
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
129
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
123
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
127
click to vote
TIME
2009
IEEE
15 years 9 months ago
2009
IEEE
Morris, Muscettola and Vidal (MMV) presented an algorithm for checking the dynamic controllability (DC) of temporal networks in which certain temporal durations are beyond the con...
129
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...