164 search results - page 1 / 33 » The Future Is Parallel But It May Not Be Easy |
HIPC
2007
Springer
14 years 19 days ago
2007
Springer
HPDC
2007
IEEE
14 years 5 months ago
2007
IEEE
With the evolution of technology, Grids cannot be considered any more solely as a federation of a modest number of powerful cluster computers. Trends show that future Grids will i...
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 10 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CLOUDCOM
2010
Springer
13 years 8 months ago
2010
Springer
The pervasive concept of cloud computing suggests that visualization, which is both data and computing intensive, is a perfect cloud computing application. This paper presents a s...