2252 search results - page 197 / 451 » Lower Bounds for Dynamic Algorithms |
143
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract This paper is concerned with the problem where a mobile robot of size D has to navigate to a target in an unknown planar environment. The competitiveness of an on-line nav...
125
Voted
SC
1994
ACM
15 years 7 months ago
1994
ACM
The N - body problem is to simulate the motion of N particles under the influence of mutual force fields based on an inverse square law. Greengard's algorithm claims to compu...
156
Voted
CN
2006
15 years 3 months ago
2006
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
106
Voted
TCS
2002
15 years 3 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
162
Voted
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...