2438 search results - page 466 / 488 » Scheduling problems for parallel and distributed systems |
122
click to vote
CC
2007
Springer
15 years 3 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 ...
133
Voted
HPCA
2003
IEEE
16 years 4 months ago
2003
IEEE
A challenging issue in today's server systems is to transparently deal with failures and application-imposed requirements for continuous operation. In this paper we address t...
125
click to vote
DCOSS
2007
Springer
15 years 10 months ago
2007
Springer
With the proliferation of various kinds of sensor networks, we will see large amounts of heterogeneous data. They have different characteristics such as data content, formats, mod...
185
click to vote
EGPGV
2004
Springer
15 years 9 months ago
2004
Springer
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
110
click to vote
GCC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Search is until now a difficult problem in peer-to-peer (P2P) filesharing systems. In this paper, we propose to use adaptive metadata spreading to make search in P2P netw...