3678 search results - page 292 / 736 » On the Stable Paths Problem |
218
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
162
click to vote
DM
2008
15 years 6 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
191
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper we study the problem of controlling a number of Unmanned Aerial Vehicles (UAVs) to provide convoy protection to a group of ground vehicles. The UAVs are modeled as Du...
217
click to vote
ESSLLI
2009
Springer
15 years 5 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
189
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...