Sciweavers

2714 search results - page 251 / 543
» Approximation Schemes for Scheduling
Sort
View
NIPS
2008
15 years 8 months ago
Sparse Convolved Gaussian Processes for Multi-output Regression
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...
Mauricio Alvarez, Neil D. Lawrence
NIPS
2008
15 years 8 months ago
Regularized Policy Iteration
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...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 6 months ago
Local algorithms in (weakly) coloured graphs
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 ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
RTSS
1992
IEEE
15 years 10 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
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 ...
Chao-Ju Hou, Kang G. Shin
INFOCOM
2009
IEEE
16 years 1 months ago
LayerP2P: A New Data Scheduling Approach for Layered Streaming in Heterogeneous Networks
—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...
Xin Xiao, Yuanchun Shi, Yuan Gao, Qian Zhang