Sciweavers

420 search results - page 5 / 84
» Discrete mobile centers
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
INFOCOM
2007
IEEE
14 years 1 months ago
Discrete Power Control: Cooperative and Non-Cooperative Optimization
— We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint o...
Eitan Altman, Konstantin Avrachenkov, Gregory Mill...
NSDI
2010
13 years 9 months ago
SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary Topologies
Operators of data centers want a scalable network fabric that supports high bisection bandwidth and host mobility, but which costs very little to purchase and administer. Ethernet...
Jayaram Mudigonda, Praveen Yalagandula, Mohammad A...
WSC
2007
13 years 9 months ago
Bi-criteria evaluation of an outpatient procedure center via simulation
Surgical services require the coordination of many activities, including patient check-in and surgical preparation, surgery, and recovery after surgery. Each of these activities r...
Todd R. Huschka, Brian T. Denton, Serhat Gul, John...