Sciweavers

1110 search results - page 47 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
MTA
2007
79views more  MTA 2007»
14 years 10 months ago
Periodic broadcast with dynamic server selection
Abstract—Service replication is an effective way to address resource requirements and resource availability problem. Dynamic service selection enables clients to choose a server ...
Ewa Kusmierek, Yingping Lu, David Hung-Chang Du
ATAL
2005
Springer
15 years 4 months ago
Improving reinforcement learning function approximators via neuroevolution
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
Shimon Whiteson
ICML
2006
IEEE
15 years 5 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
AML
2008
124views more  AML 2008»
14 years 11 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
JOLLI
2006
123views more  JOLLI 2006»
14 years 11 months ago
Cut and Pay
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
Marcelo Finger, Dov M. Gabbay