2796 search results - page 16 / 560 » The coolest path problem |
129
click to vote
ICCCN
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links h...
142
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
135
Voted
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
137
click to vote
MICRO
2006
IEEE
15 years 10 months ago
2006
IEEE
Dynamic software bug detection tools are commonly used because they leverage run-time information. However, they suffer from a fundamental limitation, the Path Coverage Problem: t...
ICRA
2009
IEEE
15 years 11 months ago
2009
IEEE
— This paper focuses on time-optimal path tracking, which involves planning of robot motions along prescribed geometric paths. Starting from a discretized convex reformulation of...