Sciweavers

1691 search results - page 129 / 339
» The Delayed k-Server Problem
Sort
View
ICPP
1992
IEEE
14 years 2 months ago
Adaptive Binary Sorting Schemes and Associated Interconnection Networks
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
Minze V. Chien, A. Yavuz Oruç
DIS
2007
Springer
14 years 2 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
INFOCOM
2007
IEEE
14 years 4 months ago
Randomized Decentralized Broadcasting Algorithms
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
Laurent Massoulié, Andrew Twigg, Christos G...
FMCAD
2007
Springer
14 years 4 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
GLOBECOM
2006
IEEE
14 years 4 months ago
Adaptive Coding and Modulation for Hybrid ARQ Systems over Partially Observable Nakagami-m Fading Channels
— We study coding and modulation rate adaptation problem for HARQ systems with partially observable state from cross-layer viewpoint. The rate of convolutionally coded MQAM is ad...
Ashok K. Karmokar, Vijay K. Bhargava