Sciweavers

1480 search results - page 101 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
IPCCC
2007
IEEE
14 years 5 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
COMCOM
1998
106views more  COMCOM 1998»
13 years 10 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
ATAL
2010
Springer
13 years 11 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 8 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ICC
2008
IEEE
112views Communications» more  ICC 2008»
14 years 5 months ago
Weighted Fair Uplink/Downlink Access Provisioning in IEEE 802.11e WLANs
— We present the unfairness problem between the uplink and the downlink flows in the IEEE 802.11e infrastructure Basic Service Set (BSS) when the default settings of the Enhance...
Feyza Keceli, Inanc Inan, Ender Ayanoglu