2252 search results - page 123 / 451 » Lower Bounds for Dynamic Algorithms |
144
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
131
click to vote
NIPS
2008
15 years 4 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
109
click to vote
SOFSEM
1997
Springer
15 years 7 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
147
click to vote
RTSS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
127
click to vote
ASPDAC
1995
ACM
15 years 6 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...