4565 search results - page 495 / 913 » Time Optimal Self-Stabilizing Algorithms |
116
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
115
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
119
click to vote
DATE
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
140
Voted
AHSWN
2008
15 years 4 months ago
2008
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
130
Voted
SIAMDM
2002
15 years 3 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...