220 search results - page 43 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
SODA
2010
ACM
13 years 3 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...
WSNA
2003
ACM
13 years 10 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
WINE
2009
Springer
13 years 12 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
AAAI
2010
13 years 6 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....