Sciweavers

552 search results - page 16 / 111
» Lower bounds for dynamic connectivity
Sort
View
MSS
2010
IEEE
127views Hardware» more  MSS 2010»
14 years 8 months ago
Fair intergenerational sharing of a natural resource
Overlapping generations are extracting a natural resource over an infinite future. We examine fair allocation of resource and compensations among generations. Fairness is define...
Hippolyte d'Albis, Stefan Ambec
MP
2006
88views more  MP 2006»
14 years 9 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 4 months ago
A Delay-Bounded Dynamic Interactive Power Control Algorithm for VANETs
— To enable real-time and robust message delivery, the highly mobile Vehicular Ad Hoc Networks (VANETs) call for comprehensive investigation on the dynamic power control effects ...
Chunxiao Chigan, Jialiang Li
CN
2006
75views more  CN 2006»
14 years 9 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
ROBOCOMM
2007
IEEE
15 years 4 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme