Sciweavers

4565 search results - page 498 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 4 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICALP
1992
Springer
15 years 8 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
116
Voted
RAS
2008
124views more  RAS 2008»
15 years 3 months ago
On redundancy, efficiency, and robustness in coverage for multiple robots
Motivated by potential efficiency and robustness gains, there is growing interest in the use of multiple robots for coverage. In coverage, robots visit every point in a target are...
Noam Hazon, Gal A. Kaminka
MOR
2007
109views more  MOR 2007»
15 years 3 months ago
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
Torpong Cheevaprawatdomrong, Irwin E. Schochetman,...
ADHOCNOW
2008
Springer
15 years 10 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...