104 search results - page 9 / 21 » Tight Bounds for Point Recolouring |
JUCS
2007
13 years 7 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...
ISSS
2000
IEEE
13 years 11 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...
CORR
2008
Springer
13 years 7 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 ...
SIROCCO
2010
13 years 8 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 ...
LCTRTS
2005
Springer
14 years 26 days 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...