Sciweavers

4781 search results - page 196 / 957
» Online algorithms for network design
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
ICC
2007
IEEE
102views Communications» more  ICC 2007»
16 years 28 days ago
M-gated Scheduling in Wireless Networks: Performance and Cross-layer Design
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
Yan Li, Guangxi Zhu
MUE
2007
IEEE
120views Multimedia» more  MUE 2007»
16 years 27 days ago
Design and Implementation of Secure Communication Channels over UPnP Networks
The scale of smart living spaces can be varied from small, e.g. a household, to large, e.g. a building or a campus, scales. As the scale of the space increases, we can expect that...
Jiunn-Jye Lee, Chun-Ying Huang, Li-Yuan Lee, Chin-...
PDPTA
2004
15 years 8 months ago
Design of a Real-Time Scheduler for Kahn Process Networks on Multiprocessor Systems
High-throughput real-time systems require non-standard and costly hardware and software solutions. Modern workstation can represent a credible alternative to develop realtime inte...
Javed Dulloo, Philippe Marquet
FBIT
2007
IEEE
16 years 29 days ago
Evaluation of a Dominance-Based Rough Set Approach to Interface Design
This paper explores refinements to methods used in a procedure being developed by the authors to personalize user interfaces for online shopping support tools. In the authors’ ...
Timothy Maciag, Daryl H. Hepting, Robert J. Hilder...