5055 search results - page 142 / 1011 » Relative Timing |
125
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
123
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
186
Voted
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
160
click to vote
AINA
2010
IEEE
15 years 10 months ago
2010
IEEE
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
141
click to vote
FM
2001
Springer
15 years 9 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...