Sciweavers

2944 search results - page 220 / 589
» Improving Bound Propagation
Sort
View
AAAI
2006
15 years 8 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons
AIPS
2004
15 years 8 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
AAAI
1996
15 years 8 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang
ICML
2010
IEEE
15 years 7 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
CORR
2008
Springer
100views Education» more  CORR 2008»
15 years 6 months ago
Lossy Source Transmission over the Relay Channel
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
Deniz Gündüz, Elza Erkip, Andrea J. Gold...