New kth-shortest path algorithm

H. Maruyama

IEICE Transactions on Information and Systems

Paper

01 Mar 1993

New kth-shortest path algorithm

Abstract

This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.

Conference paper

On Trajectory Augmentations for Off-Policy Evaluation

Ge Gao, Qitong Gao, et al.

ICLR 2024

Conference paper

Learning Reduced Order Dynamics via Geometric Representations

Imran Nasim, Melanie Weber

SCML 2024

Conference paper

Cell GC: Using the cell synergistic processor as a garbage collection coprocessor

Chen-Yong Cher, Michael Gschwind

VEE 2008

Conference paper

Practicing the best practice: Designing effective health care experiences

Susan L. Spraragen

International Conference on Design and Emotion 2010

View all publications

Abstract

Related

On Trajectory Augmentations for Off-Policy Evaluation

Learning Reduced Order Dynamics via Geometric Representations

Cell GC: Using the cell synergistic processor as a garbage collection coprocessor

Practicing the best practice: Designing effective health care experiences