1257 search results - page 52 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
SIPS
2007
IEEE
15 years 6 months ago
2007
IEEE
OFDM demodulation under fast fading radio channels is very computationally demanding, making the implementation of Software Defined Radio (SDR) solutions problematic. A suboptima...
101
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Planning in single-agent models like MDPs and POMDPs can be carried out by resorting to Q-value functions: a (near-) optimal Q-value function is computed in a recursive manner by ...
105
click to vote
SOSP
2009
ACM
15 years 8 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
103
click to vote
CF
2008
ACM
15 years 1 months ago
2008
ACM
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...