2714 search results - page 251 / 543 » Approximation Schemes for Scheduling |
147
click to vote
NIPS
2008
15 years 5 months ago
2008
We present a sparse approximation approach for dependent output Gaussian processes (GP). Employing a latent function framework, we apply the convolution process formalism to estab...
148
click to vote
NIPS
2008
15 years 5 months ago
2008
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
134
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
149
click to vote
RTSS
1992
IEEE
15 years 8 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
117
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Although layered streaming in heterogeneous peer-to-peer networks has drawn great interest in recent years, there’s still a lack of systematical studies on its data scheduling...