16159 search results - page 2750 / 3232 » Parallel computing with CUDA |
183
Voted
PODC
2005
ACM
16 years 13 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
181
Voted
PODC
2005
ACM
16 years 13 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
135
click to vote
PPOPP
2005
ACM
16 years 13 days ago
2005
ACM
Recently, system architects have built low-power, high-performance clusters, such as Green Destiny. The idea behind these clusters is to improve the energy efficiency of nodes. H...
236
click to vote
PPOPP
2005
ACM
16 years 13 days ago
2005
ACM
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose at run-time. This motivated the development of type systems that statically en...
187
Voted
SPAA
2005
ACM
16 years 13 days ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...