4894 search results - page 303 / 979 » The Guarding Problem - Complexity and Approximation |
166
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
180
click to vote
ISLPED
2007
ACM
15 years 8 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
178
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...
171
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
163
click to vote
WSC
2004
15 years 8 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...