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.

Demo paper

SupervisorBot: NLP-Annotated Real-Time Recommendations of Psychotherapy Treatment Strategies with Deep Reinforcement Learning

Baihan Lin, Guillermo Cecchi, et al.

IJCAI 2023

Workshop paper

Licence to Scale: A Microservice Simulation Environment for Benchmarking Agentic AI

Christopher Lohse, Adrian Selk, et al.

NeurIPS 2025

Paper

Bin ratio-based histogram distances and their application to image classification

Weiming Hu, Nianhua Xie, et al.

IEEE TPAMI

Paper

Information Theoretic Guarantees For Policy Alignment In Large Language Models

Youssef Mroueh, Apoorva Nitsure

TMLR

View all publications

Abstract

Related

SupervisorBot: NLP-Annotated Real-Time Recommendations of Psychotherapy Treatment Strategies with Deep Reinforcement Learning

Licence to Scale: A Microservice Simulation Environment for Benchmarking Agentic AI

Bin ratio-based histogram distances and their application to image classification

Information Theoretic Guarantees For Policy Alignment In Large Language Models