6105 search results - page 830 / 1221 » A Parallel Algorithm for Bound-Smoothing |
186
click to vote
DCOSS
2009
Springer
16 years 1 months ago
2009
Springer
Sensor networks introduce new resource allocation problems in which sensors need to be assigned to the tasks they best help. Such problems have been previously studied in simplifi...
177
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we examine the concept of giving every job a trial run before committing it to run until completion. Trial runs allow immediate job failures to be detected shortly a...
146
click to vote
JSSPP
2009
Springer
16 years 1 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
222
click to vote
C5
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper provides an overview of MediaDART, a framework for building online services for distributing and sharing digital media. Inspired by the participative model of Web 2.0, ...
170
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper examines the potential of the Cell processor as a platform for secure data mining on the future volunteer computing systems. Volunteer computing platforms have the p...