Sciweavers

299 search results - page 7 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
104
Voted
MOBIHOC
2008
ACM
15 years 11 months ago
Complexity of scheduling with analog network coding
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
Olga Goussevskaia, Roger Wattenhofer
MOBICOM
2006
ACM
15 years 5 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
ICC
2007
IEEE
141views Communications» more  ICC 2007»
15 years 6 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
BMCBI
2005
131views more  BMCBI 2005»
14 years 11 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
INFOCOM
2007
IEEE
15 years 6 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...