1257 search results - page 59 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
102
click to vote
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Combinatorial optimization problems have recently emerged in the design of controllers for OLED displays. The objective is to decompose an image into subframes minimizing the addre...
103
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes t...
115
click to vote
IEEEPACT
1997
IEEE
15 years 4 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
GCC
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
102
click to vote
HPCC
2007
Springer
15 years 6 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...