Sciweavers

4 search results - page 1 / 1
» Semi-matchings for bipartite graphs and load balancing
Sort
View
JAL
2006
101views more  JAL 2006»
13 years 4 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
13 years 6 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
ICCCN
2007
IEEE
13 years 8 months ago
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks
In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event l...
You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Yu...
ICCCN
2008
IEEE
13 years 11 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu