Sciweavers

614 search results - page 69 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
IPCCC
2005
IEEE
15 years 3 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
15 years 2 months ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
14 years 11 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
SPAA
2009
ACM
15 years 4 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
SOFSEM
2007
Springer
15 years 4 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner