pith. sign in

hub

A formal basis for the heuristic determination of minimum cost paths

15 Pith papers cite this work. Polarity classification is still indexing.

15 Pith papers citing it

hub tools

citation-role summary

background 2 method 1

citation-polarity summary

clear filters

representative citing papers

Are Flat Minima an Illusion?

cs.LG · 2026-03-24 · unverdicted · novelty 8.0

Flat minima are illusory; generalization is driven by weakness, a reparameterization-invariant measure of compatible completions that predicts performance better than sharpness on MNIST and Fashion-MNIST.

OSCAR: Obstacle Survival Curves for Adaptive Robot Navigation

cs.RO · 2026-05-31 · unverdicted · novelty 7.0

OSCAR learns class-conditioned survival distributions for obstacle clearance times online (handling right-censored data) to compute patience thresholds in graph-based navigation, converging near oracle performance after few observations per class.

Logic-Constrained Shortest Paths for Flight Planning

cs.AI · 2024-12-17 · conditional · novelty 6.0

A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.

Learning Empirically Admissible Neural Heuristics for Combinatorial Search

cs.LG · 2026-06-03 · unverdicted · novelty 5.0

Presents a framework for training empirically admissible neural heuristics via underestimating Bellman operator, asymmetric loss, and validation calibration offset, reporting reduced node expansions with no observed admissibility violations on small puzzles.

citing papers explorer

Showing 1 of 1 citing paper after filters.