Sciweavers

10909 search results - page 9 / 2182
» Evaluating Backup Algorithms
Sort
View
COLT
2000
Springer
15 years 1 months ago
Bias-Variance Error Bounds for Temporal Difference Updates
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
Michael J. Kearns, Satinder P. Singh
ICML
1996
IEEE
15 years 10 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
BROADNETS
2007
IEEE
15 years 3 months ago
IP fast rerouting for single-link/node failure recovery
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
Kang Xi, H. Jonathan Chao
DSN
2004
IEEE
15 years 1 months ago
On Failure Dependent Protection in Optical Grooming Networks
Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a bac...
Srinivasan Ramasubramanian
INFOCOM
2008
IEEE
15 years 3 months ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly