Sciweavers

392 search results - page 49 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Asymptotically optimal power-aware routing for multihop wireless networks with renewable energy sources
— In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize th...
Xiaojun Lin, Ness B. Shroff, R. Srikant
ICCAD
2003
IEEE
141views Hardware» more  ICCAD 2003»
14 years 1 months ago
An Enhanced Multilevel Algorithm for Circuit Placement
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
Tony F. Chan, Jason Cong, Tim Kong, Joseph R. Shin...
ATAL
2010
Springer
13 years 9 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
13 years 9 months ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Anil Kamath, Omri Palmon, Serge A. Plotkin
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 8 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...