Sciweavers

31 search results - page 6 / 7
» Improved bounds for the unsplittable flow problem
Sort
View
TWC
2008
152views more  TWC 2008»
13 years 5 months ago
Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
Yaxin Cao, Ka-Cheong Leung, Victor O. K. Li
MOBIHOC
2006
ACM
14 years 5 months ago
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
Jingpu Shi, Theodoros Salonidis, Edward W. Knightl...
CAAN
2007
Springer
13 years 10 months ago
Nonadaptive Selfish Routing with Online Demands
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
Tobias Harks, László A. Végh
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 6 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
FPGA
2006
ACM
113views FPGA» more  FPGA 2006»
13 years 9 months ago
Optimality study of logic synthesis for LUT-based FPGAs
Abstract--Field-programmable gate-array (FPGA) logic synthesis and technology mapping have been studied extensively over the past 15 years. However, progress within the last few ye...
Jason Cong, Kirill Minkovich