Sciweavers

3147 search results - page 18 / 630
» Distributed averaging in dynamic networks
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 10 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
DATE
2008
IEEE
128views Hardware» more  DATE 2008»
14 years 4 months ago
Dynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution
This paper presents a method of dynamic voltage scaling (DVS) that tackles both switching and leakage power with combined Vdd/Vbs scaling and gives minimum average energy consumpt...
Sungpack Hong, Sungjoo Yoo, Byeong Bin, Kyu-Myung ...
GLOBECOM
2008
IEEE
14 years 4 months ago
Optimized Opportunistic Multicast Scheduling over Cellular Networks
—The design of optimal opportunistic multicast scheduling (OMS) that maximizes the throughput of cellular networks is investigated. In a cellular network, the base station (BS) t...
Tze-Ping Low, Man-On Pun, C. C. Jay Kuo
ICC
2007
IEEE
193views Communications» more  ICC 2007»
14 years 4 months ago
Cost-Effective MAP Selection in HMIPv6 Networks
— In Hierarchical Mobile IPv6(HMIPv6) networks, the system performance is critically affected by the selection of Mobile Anchor Points(MAPs) and its load status. Thus, in this pa...
Wonsik Chung, SuKyoung Lee
IWCMC
2010
ACM
14 years 2 months ago
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
In reactive routing protocols, active routes for multihop connections retain their topological structure in spite of node movement over time. Unfortunately, node movements may mak...
Zeki Bilgin, Bilal Khan, Ala I. Al-Fuqaha