2796 search results - page 50 / 560 » The coolest path problem |
127
click to vote
AIPS
2011
14 years 3 months ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— The paper studies the coordinated path following problem, namely, steering a group of unicycles to a given path while achieving an inter-vehicle formation pattern. A novel hybr...
VLSID
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...