279 search results - page 10 / 56 » Reduction approaches for robust shortest path problems |
MATES
2010
Springer
14 years 8 months ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
80
Voted
COSIT
1995
Springer
15 years 1 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
ISPEC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Secure routing in ad hoc networks has been extensively studied in recent years. The vast majority of this work, however, has only focused on providing authenticity of the...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...