613 search results - page 57 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
192
click to vote
ICCAD
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
186
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
114
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
125
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
145
Voted
STOC
2000
ACM
15 years 7 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...