82 search results - page 15 / 17 » Maximizing Job Completions Online |
104
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
101
click to vote
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...
TMC
2010
14 years 10 months ago
2010
—This paper deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than...
102
click to vote
DATE
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we present an approach to the synthesis of fault-tolerant schedules for embedded applications with soft and hard real-time constraints. We are interested to guarante...
HPDC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...