613 search results - page 49 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
104
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
105
click to vote
ISQED
2010
IEEE
15 years 4 months ago
2010
IEEE
Leakage power has grown significantly and is a major challenge in SoC design. Among SoC's components, clock distribution network power accounts for a large portion of chip po...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...