Sciweavers

14331 search results - page 2656 / 2867
» On the modeling and analysis of obligations
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
TCOM
2010
99views more  TCOM 2010»
15 years 5 months ago
Code design for MIMO downlink with imperfect CSIT
—In this letter, we implement a simplified version of the Cover - van der Meulen - Hajek - Pursley (CMHP) coding originally characterized by Wajcer, Wiesel, and Shamai. The vect...
Hyung-Tae Kim, Sung Hoon Lim, Inkyu Lee, Saejoon K...
TELSYS
2010
122views more  TELSYS 2010»
15 years 5 months ago
Transmission scheduling for multi-homed transport protocols with network failure tolerance
In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed ...
Yuansong Qiao, Enda Fallon, John Murphy, Liam Murp...
TMI
2010
94views more  TMI 2010»
15 years 5 months ago
Theoretical Bounds and System Design for Multipinhole SPECT
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
Peter Nillius, Mats Danielsson
TPDS
2010
135views more  TPDS 2010»
15 years 5 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
« Prev « First page 2656 / 2867 Last » Next »