4110 search results - page 355 / 822 » Efficient algorithms for the 2-gathering problem |
204
Voted
TCSV
2008
15 years 6 months ago
2008
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
188
Voted
RAS
2002
15 years 6 months ago
2002
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and pri...
193
click to vote
ADHOCNOW
2010
Springer
15 years 4 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
194
click to vote
IPCO
2004
15 years 8 months ago
2004
Managing an industrial production facility requires carefully allocating limited resources, and gives rise to large, potentially complicated scheduling problems. In this paper we c...
305
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...