248 search results - page 24 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
122
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we present an advanced bidding agent that participates in first-price sealed bid auctions to allocate advertising space on BluScreen – an experimental public adve...
125
Voted
VLDB
1991
ACM
15 years 6 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
119
click to vote
SIGECOM
2009
ACM
15 years 9 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
107
click to vote
WDAG
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
121
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...