Sciweavers

1259 search results - page 50 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
CSREAESA
2003
15 years 5 months ago
Static Pattern Predictor (SPP) Based Low Power Instruction Cache Design
Energy dissipation in cache memories is becoming a major design issue in embedded microprocessors. Predictive filter cache based instruction cache hierarchy is effective in reduci...
Kugan Vivekanandarajah, Thambipillai Srikanthan, C...
PEWASUN
2006
ACM
15 years 10 months ago
Performance evaluation of backoff algorithms in 802.11 ad-hoc networks
Understanding the performance of backoff algorithms in multihop ad hoc networks is a key feature to design efficient Medium Access Protocols for wireless networks. The 802.11 bac...
Tahiry Razafindralambo, Fabrice Valois
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 9 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
VTC
2007
IEEE
192views Communications» more  VTC 2007»
15 years 10 months ago
Access Scheduling Based on Time Water-Filling for Next Generation Wireless LANs
Opportunistic user access scheduling enhances the capacity of wireless networks by exploiting the multi user diversity. When frame aggregation is used, opportunistic schemes are no...
Ertugrul Necdet Ciftcioglu, Özgür Gü...