Sciweavers

121 search results - page 11 / 25
» Optimal Group Manipulation in Facility Location Problems
Sort
View
INFOCOM
1998
IEEE
15 years 1 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 4 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 7 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
81
Voted
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 4 months ago
Distributed grasp synthesis for swarm manipulation with applications to autonomous tugboats
— Assume a swarm of mobile robots is in the act of transporting a large object in the plane, by applying unilateral forces to the perimeter of that object. We address the questio...
Joel M. Esposito
FOCS
2004
IEEE
15 years 1 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy