2796 search results - page 146 / 560 » The coolest path problem |
109
click to vote
DM
2008
15 years 4 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...
134
Voted
ICRA
2010
IEEE
15 years 3 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...
173
Voted
ESSLLI
2009
Springer
15 years 2 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...
153
Voted
JCP
2007
15 years 5 months ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
141
Voted
INFOCOM
2006
IEEE
15 years 11 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...