121 search results - page 17 / 25 » Optimal Group Manipulation in Facility Location Problems |
68
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Consider a coverage problem for a team of agents in the plane: target points appear sporadically over time in a bounded environment and must be visited by one of the agents. It...
SIAMJO
2000
14 years 9 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
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 ...
SUTC
2010
IEEE
15 years 1 months ago
2010
IEEE
— Extensive research has been performed to study selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root ...
SAC
1994
ACM
15 years 1 months ago
1994
ACM
Traditional database technology may be extended by taking advantage of the facilities of an integrated persistent programming environment. This paper focuses on how such an enviro...