Sciweavers

Share
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
9 years 10 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
9 years 10 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
9 years 10 months ago
Selling ad campaigns: online algorithms with cancellations
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...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
9 years 10 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
WINE
2009
Springer
172views Economy» more  WINE 2009»
9 years 10 months ago
An Online Multi-unit Auction with Improved Competitive Ratio
We improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, ...
Sourav Chakraborty, Nikhil R. Devanur
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
9 years 10 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
STACS
2009
Springer
9 years 10 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
10 years 1 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
10 years 4 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
books