674 search results - page 50 / 135 » The computational complexity of the parallel knock-out probl... |
128
click to vote
ICPP
1992
IEEE
15 years 5 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
EUROPAR
2009
Springer
15 years 8 months ago
2009
Springer
The transition to multicore architectures has dramatically underscored the necessity for parallelism in software. In particular, while new gaming consoles are by and large multicor...
152
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
120
click to vote
PPSN
1998
Springer
15 years 5 months ago
1998
Springer
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
129
click to vote
SAG
2004
Springer
15 years 6 months ago
2004
Springer
Bioinformatics applications manage complex biological data stored into distributed and often heterogeneous databases and require large computing power. Among these, protein structu...