Sciweavers

9949 search results - page 321 / 1990
» On the Network Complexity of Selection
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
ASPDAC
2006
ACM
105views Hardware» more  ASPDAC 2006»
16 years 23 days ago
Improving routing efficiency for network-on-chip through contention-aware input selection
- The performance of Network-on-Chip (NoC) largely depends on the underlying routing techniques, which have two constituencies: output selection and input selection. Previous resea...
Dong Wu, Bashir M. Al-Hashimi, Marcus T. Schmitz
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
15 years 10 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
DCC
2004
IEEE
16 years 6 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui