2168 search results - page 88 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
128
Voted
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
153
Voted
SI3D
2006
ACM
15 years 9 months ago
2006
ACM
This paper studies jump flooding as an algorithmic paradigm in the general purpose computation with GPU. As an example application of jump flooding, the paper discusses a constant...
120
Voted
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Two schemes proposed to cope with unrecoverable or latent media errors and enhance the reliability of RAID systems are examined. The first scheme is the established, widely used d...
141
Voted
ENTCS
2007
15 years 3 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
130
Voted
HPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...