874 search results - page 96 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
109
Voted
DCOSS
2009
Springer
15 years 8 months ago
2009
Springer
Many wireless standards and protocols today, such as WLAN and Bluetooth, operate on similar frequency bands. While this permits an efficient usage of the limited medium capacity, ...
147
click to vote
PDCAT
2005
Springer
15 years 7 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
CCGRID
2002
IEEE
15 years 6 months ago
2002
IEEE
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
107
click to vote
ICPP
2009
IEEE
15 years 8 months ago
2009
IEEE
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
163
click to vote
PODC
2011
ACM
14 years 4 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...