Sciweavers

33 search results - page 6 / 7
» Improved Approximation Algorithms for Relay Placement
Sort
View
INFOCOM
2009
IEEE
14 years 11 days ago
Link Scheduling with QoS Guarantee for Wireless Relay Networks
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
Chi-Yao Hong, Ai-Chun Pang
MDM
2009
Springer
123views Communications» more  MDM 2009»
14 years 8 days ago
Operator Placement for Snapshot Multi-predicate Queries in Wireless Sensor Networks
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
Georgios Chatzimilioudis, Huseyin Hakkoymaz, Nikos...
ICCAD
2003
IEEE
129views Hardware» more  ICCAD 2003»
13 years 11 months ago
Performance Optimization of Latency Insensitive Systems Through Buffer Queue Sizing of Communication Channels
This paper proposes for latency insensitive systems a performance optimization technique called channel buffer queue sizing, which is performed after relay station insertion in th...
Ruibing Lu, Cheng-Kok Koh
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
13 years 10 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
14 years 16 days ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert