104 search results - page 9 / 21 » Tight Bounds for Point Recolouring |
146
click to vote
JUCS
2007
15 years 1 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
133
Voted
ISSS
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
87
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
98
Voted
SIROCCO
2010
15 years 3 months ago
2010
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
97
Voted
LCTRTS
2005
Springer
15 years 7 months ago
2005
Springer
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...