Using stochastic-dominance relationships for bounding travel times in stochastic networks
暂无分享,去创建一个
[1] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[2] Randolph W. Hall,et al. The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..
[3] Kuo-Chu Chang,et al. Refinement and coarsening of Bayesian networks , 1990, UAI.
[4] Editors , 1986, Brain Research Bulletin.
[5] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[6] Narsingh Deo,et al. Shortest-path algorithms: Taxonomy and annotation , 1984, Networks.
[7] Mark S. Boddy,et al. Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..
[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[9] Robert L. Smith,et al. Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..
[10] M. Chapman Findlay,et al. Stochastic dominance : an approach to decision-making under risk , 1978 .
[11] Robert L. Smith,et al. Aggregation in Dynamic Programming , 1987, Oper. Res..
[12] Michael P. Wellman,et al. Using Qualitative Relationships for Bounding Probability Distributions , 1998, UAI.
[13] Michael P. Wellman,et al. Path Planning under Time-Dependent Uncertainty , 1995, UAI.