K⁎: A heuristic search algorithm for finding the k shortest paths

Artificial Intelligence 175 (18):2129-2154 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

多状態実時間両方向探索.村田 裕章 越野 亮 - 2004 - Transactions of the Japanese Society for Artificial Intelligence 19:68-72.
Minimal proof search for modal logic k model checking.Abdallah Saffidine - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 346--358.
A simple noise-tolerant abstraction algorithm for fast k-NN classification.Stefanos Ougiaroglou & Georgios Evangelidis - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 210--221.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,644,260)

6 months
3 (#1,046,015)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references