Sciweavers

227 search results - page 16 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
14 years 2 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 2 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
Niv Buchbinder, Kamal Jain, Joseph Naor
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
14 years 1 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 5 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
ESA
2009
Springer
156views Algorithms» more  ESA 2009»
14 years 3 months ago
On Revenue Maximization in Second-Price Ad Auctions
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, ...