113 search results - page 21 / 23 » Optimal Hardness Results for Maximizing Agreements with Mono... |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
107
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
162
click to vote
GIS
2004
ACM
15 years 10 months ago
2004
ACM
The R*-tree is a state-of-the-art spatial index structure. It has already found its way into commercial systems. The most important improvement of the R*-tree over the original R-...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
CASES
2007
ACM
15 years 1 months ago
2007
ACM
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...