4255 search results - page 45 / 851 » Cover |
AIIDE
2008
13 years 11 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
DCOSS
2008
Springer
13 years 10 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
CCCG
2007
13 years 10 months ago
2007
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
ALGORITHMICA
2010
13 years 9 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
AROBOTS
2004
13 years 8 months ago
2004
Robotics researchers have studied robots that can follow trails laid by other robots. We, on the other hand, study robots that leave trails in the terrain to cover closed terrain r...