Sciweavers

16844 search results - page 3254 / 3369
» How to Design Programs
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
147
Voted
IPPS
2009
IEEE
16 years 1 months ago
Revisiting communication performance models for computational clusters
—In this paper, we analyze restrictions of traditional models affecting the accuracy of analytical prediction of the execution time of collective communication operations. In par...
Alexey L. Lastovetsky, Vladimir Rychkov, Maureen O...
MICRO
2009
IEEE
99views Hardware» more  MICRO 2009»
16 years 29 days ago
Low-cost router microarchitecture for on-chip networks
On-chip networks are critical to the scaling of future multicore processors. The challenge for on-chip network is to reduce the cost including power consumption and area while pro...
John Kim
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
16 years 28 days ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
216
Voted
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
16 years 28 days ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
« Prev « First page 3254 / 3369 Last » Next »