Sciweavers

2747 search results - page 508 / 550
» Non-oblivious Strategy Improvement
Sort
View
TCOM
2008
105views more  TCOM 2008»
14 years 10 months ago
High-rate diversity across time and frequency using linear dispersion
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
Jinsong Wu, Steven D. Blostein
INTEGRATION
2007
90views more  INTEGRATION 2007»
14 years 10 months ago
Partitioning-based decoupling capacitor budgeting via sequence of linear programming
In this paper, we propose an efficient algorithm to reduce the voltage noises for on-chip power/ground (P/G) networks of VLSI. The new method is based on the sequence of linear p...
Jeffrey Fan, Sheldon X.-D. Tan, Yici Cai, Xianlong...
ASE
2005
96views more  ASE 2005»
14 years 10 months ago
A Termination Detection Protocol for Use in Mobile Ad Hoc Networks
As devices become smaller and wireless networking technologies improve, the popularity of mobile computing continues to rise. In today's world, many consider devices such as c...
Gruia-Catalin Roman, Jamie Payton
TIT
2008
119views more  TIT 2008»
14 years 10 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
JAIR
2007
141views more  JAIR 2007»
14 years 10 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf