Sciweavers

1289 search results - page 187 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
ICC
2007
IEEE
119views Communications» more  ICC 2007»
15 years 4 months ago
Spatio-Temporal Dynamic Spectrum Allocation with Interference Handling
— As for today, radio spectrum resource is rigidly partitioned for dedicated purposes. The exclusive license of fixed size spectrum blocks separated by guard bands easily solves...
László Kovacs, Attila Vidács,...
INFOCOM
2007
IEEE
15 years 4 months ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
IPPS
2006
IEEE
15 years 3 months ago
FIFO scheduling of divisible loads with return messages under the one-port model
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
Olivier Beaumont, Loris Marchal, Veronika Rehn, Yv...
ISM
2006
IEEE
92views Multimedia» more  ISM 2006»
15 years 3 months ago
Strategies for Efficient Streaming in Delay-Tolerant Multimedia Applications
We consider Multimedia applications where clients specify a minimum desired stream rate (quality) and a time till when they are willing to wait, termed delay tolerance. The Conten...
Saraswathi Krithivasan, Sridhar Iyer
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 3 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...