203 search results - page 21 / 41 » A New Derandomization of Auctions |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
IH
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Traditionally, cryptographic protocols are described as a sequence of steps, in each of which one principal sends a message to another. It is assumed that the fundamental...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We study principled methods for incorporating user utility into the selection of sponsored search ads. We describe variations of the GSP allocation/pricing mechanism that accommod...
AAAI
2004
13 years 9 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
ICCAD
2010
IEEE
13 years 4 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...