33 search results - page 3 / 7 » Facility Location with Dynamic Distance Functions |
138
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
122
click to vote
GIS
2009
ACM
15 years 5 months ago
2009
ACM
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
115
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
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...
141
click to vote
SODA
2010
ACM
14 years 11 months ago
2010
ACM
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...
144
click to vote
CC
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...