Sciweavers

438 search results - page 47 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
Allocating Servers in Infostations for On-Demand Communications
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
MST
2006
136views more  MST 2006»
13 years 7 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
MOBICOM
2009
ACM
14 years 2 months ago
Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms
In November 2008, the FCC ruled that the digital TV whitespaces be used for unlicensed access. This is an exciting development because DTV whitespaces are in the low frequency ran...
Supratim Deb, Vikram Srinivasan, Ritesh Maheshwari
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
Improved Approximation Guarantees for Lower-Bounded Facility Location
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
Sara Ahmadian, Chaitanya Swamy
OOPSLA
2009
Springer
14 years 2 months ago
Towards automation of iteration planning
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
Jonas Helming, Maximilian Koegel, Zardosht Hodaie