3267 search results - page 374 / 654 » Generalized quasirandom graphs |
196
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
170
click to vote
MOBIWAC
2006
ACM
16 years 20 days ago
2006
ACM
Convergecast is a fundamental operation in wireless sensor networks. Existing convergecast solutions have focused on reducing latency and energy consumption. However, a good desig...
187
click to vote
PPOPP
2005
ACM
16 years 7 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
177
click to vote
MSWIM
2004
ACM
16 years 3 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
185
click to vote
CC
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The register allocation in loops is generally performed after or during the software pipelining process. This is because doing a conventional register allocation at firs...