1110 search results - page 104 / 222 » New Approximation Results for Resource Replication Problems |
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— Due to the abundant application background, the optimization of maintenance problem has been extensively studied in the past decades. Besides the well-known difficulty of larg...
85
Voted
JDA
2011
14 years 6 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
WWW
2007
ACM
15 years 11 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
107
click to vote
AAAI
2012
13 years 1 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
109
click to vote
NIPS
2001
15 years 15 days ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...