3047 search results - page 193 / 610 » Randomized Parallel Selection |
148
click to vote
PERCOM
2005
ACM
16 years 1 months ago
2005
ACM
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
114
click to vote
ICPP
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we formulate the array robustness theorems (ARTs) for efficient computation and communication on faulty arrays. No hardware redundancy is required and no assumptio...
JPDC
2006
15 years 2 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
117
click to vote
IEEEINTERACT
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper introduces a method for improving program run-time performance by gathering work in an application and executing it efficiently in an integrated thread. Our methods ext...
140
click to vote
COR
2011
14 years 8 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...