2796 search results - page 272 / 560 » The coolest path problem |
200
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
164
click to vote
IEAAIE
2009
Springer
16 years 1 months ago
2009
Springer
One of the main problems that we have to face when visiting public or official buildings (i.e hospitals or public administrations) is the lack of information and signs that can gui...
192
click to vote
ICCSA
2007
Springer
16 years 24 days ago
2007
Springer
In this paper we address the problem of working paths optimization in survivable MPLS network. We focus on an existing facility network, in which only network flows can be optimize...
143
click to vote
COCOON
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
196
click to vote
LCPC
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. A fundamental problem in the analysis of parallel programs is to determine when two statements in a program may run concurrently. This analysis is the parallel analog to ...