1486 search results - page 82 / 298 » Algorithms for two-box covering |
134
click to vote
ICRA
2002
IEEE
15 years 8 months ago
2002
IEEE
We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot coverage algorithm, a boustrophed...
132
click to vote
IJCGA
2000
15 years 3 months ago
2000
We present e cient algorithms for several instances of the following facility location problem. Facilities and demand sites are represented as points in the plane. Place k obnoxio...
108
click to vote
CGF
1999
15 years 3 months ago
1999
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
154
click to vote
INFSOF
2008
15 years 3 months ago
2008
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
135
click to vote
ORDER
2007
15 years 3 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...