361 search results - page 2 / 73 » Average Case Analysis of Dynamic Geometric Optimization |
ASYNC
1998
IEEE
15 years 1 months ago
1998
IEEE
We describe an automated method (3D-map) for determining near-optimal decomposed generalized C-element (gC) implementations of extended burst-mode asynchronous controllers. Averag...
93
Voted
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
100
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...