866 search results - page 130 / 174 » On Dynamic Shortest Paths Problems |
EOR
2008
13 years 9 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
AI
2011
Springer
13 years 4 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
WWW
2006
ACM
14 years 10 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
ACSC
2010
IEEE
13 years 4 months ago
2010
IEEE
The importance of networks of coupled oscillators is widely recognized. Such networks occur in biological systems like the heart, in chemical systems, in computational problems, a...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
Markov jump processes and continuous time Bayesian networks are important classes of continuous time dynamical systems. In this paper, we tackle the problem of inferring unobserve...