287 search results - page 33 / 58 » On the Power of Randomization in Algorithmic Mechanism Desig... |
153
click to vote
WIDM
2004
ACM
15 years 7 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
109
click to vote
PIMRC
2010
IEEE
14 years 12 months ago
2010
IEEE
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
132
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
151
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
111
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In a multicore transactional memory (TM) system, concurrent execution threads interact and interfere with each other through shared memory. The less interference a progra...