29 search results - page 3 / 6 » swat 2004 |
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges – short and long....
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
SWAT
2004
Springer
13 years 11 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...
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
ASPLOS
2004
ACM
13 years 11 months ago
2004
ACM
Sampling has been successfully used to identify performance optimization opportunities. We would like to apply similar techniques to check program correctness. Unfortunately, samp...