Sciweavers

220 search results - page 27 / 44
» Primal-Dual Algorithms for Connected Facility Location Probl...
Sort
View
MOBIHOC
2000
ACM
15 years 10 months ago
Role-based multicast in highly mobile but sparsely connected ad hoc networks
— We present an approach to multicasting messages among highly mobile hosts in ad hoc networks. We suggest a new definition of a role-based multicast that suits the special need...
Linda Briesemeister, Günter Hommel
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 11 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
FSR
2003
Springer
94views Robotics» more  FSR 2003»
15 years 11 months ago
Planning under Uncertainty for Reliable Health Care Robotics
We describe a mobile robot system, designed to assist residents of an retirement facility. This system is being developed to respond to an aging population and a predicted shortage...
Nicholas Roy, Geoffrey J. Gordon, Sebastian Thrun
STOC
2004
ACM
126views Algorithms» more  STOC 2004»
16 years 6 months ago
Bypassing the embedding: algorithms for low dimensional metrics
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
Kunal Talwar
COMPGEOM
2010
ACM
15 years 11 months ago
The 2-center problem in three dimensions
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir