Sciweavers

51 search results - page 7 / 11
» On a universal best choice algorithm for partially ordered s...
Sort
View
IJCSA
2008
108views more  IJCSA 2008»
13 years 7 months ago
Consistency Check Algorithms for Multi-Dimensional Preference Trade-Offs
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
Christoph Lofi, Wolf-Tilo Balke, Ulrich Güntz...
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 10 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
DAGSTUHL
2008
13 years 9 months ago
Uniprocessor EDF Feasibility is an Integer Problem
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
Enrico Bini
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 5 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...