87 search results - page 9 / 18 » Dynamic Programming for Partially Observable Stochastic Game... |
NIPS
2001
15 years 29 days ago
2001
We show that states of a dynamical system can be usefully represented by multi-step, action-conditional predictions of future observations. State representations that are grounded...
106
click to vote
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
109
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
ICPP
2003
IEEE
15 years 4 months ago
2003
IEEE
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...