193 search results - page 34 / 39 » A Lower Bound for the Shortest Path Problem |
93
Voted
VLDB
1997
ACM
15 years 3 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
100
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
PODC
2005
ACM
15 years 5 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
103
click to vote
ICRA
2005
IEEE
15 years 5 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...
JEC
2006
14 years 11 months ago
2006
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...