AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Shortest Path Based Decision Making Using Probabilistic Inference

Akshat Kumar

AAAI 2016 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
apply entropy-based penalty (rho=0.005) from iteration 1000EM for RNDP · RNDP budget 0.04 Bmaxnetwork entropy: 27.4 -> 0.42Improved
use EM instead of Cplex MIP solver on large gridsRNDP solver · RNDP 15x15 and 20x20 gridssolution cost: as high as 70%Improved
use EM instead of Cplex MIP solver on small gridsRNDP solver · RNDP 5x5 to 10x10 gridssolution cost: < 10%Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy