2095 search results - page 139 / 419 » Improved pebbling bounds |
145
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
153
click to vote
AAAI
2006
15 years 7 months ago
2006
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...
170
click to vote
AIPS
2004
15 years 7 months ago
2004
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...
181
click to vote
AAAI
1996
15 years 7 months ago
1996
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...
113
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
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...