465 search results - page 50 / 93 » On the Hardness of Range Assignment Problems |
222
Voted
GIS
2005
ACM
16 years 4 months ago
2005
ACM
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
142
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
132
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
—In 3G data networks, network operators would like to balance system throughput while serving users in a fair manner. This is achieved using the notion of proportional fairness. ...
136
Voted
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
119
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we investigate the task of Entity Ranking on the Web. Searchers looking for entities are arguably better served by presenting a ranked list of entities directly, rat...