866 search results - page 63 / 174 » On Dynamic Shortest Paths Problems |
OSN
2008
13 years 7 months ago
2008
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
ATMOS
2007
13 years 9 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
ERSHOV
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
WISE
2002
Springer
14 years 17 days ago
2002
Springer
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However, by their ver...