4843 search results - page 591 / 969 » The Shortcut Problem - Complexity and Approximation |
154
click to vote
AIPS
2008
15 years 7 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
162
click to vote
DIALM
2008
ACM
15 years 6 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
134
Voted
ECAI
2008
Springer
15 years 6 months ago
2008
Springer
In many practical reinforcement learning problems, the state space is too large to permit an exact representation of the value function, much less the time required to compute it. ...
117
click to vote
NIPS
2007
15 years 6 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
186
click to vote
NIPS
2007
15 years 6 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...