A Probabilistic Analysis for Greedy Paths

DOI10.1063/1.2990983MaRDI QIDQ3621317zbMATH OpenOpenAlexFDO

Authors Yashar Tavakoli, Hossein Erfani, H. H. S. Javadi

Publication date 21 April 2009

Published in AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1063/1.2990983

zbMATH Keywords

Markov chainspath finding

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 4131689
• An intelligent search path
• scientific article; zbMATH DE number 437569
• scientific article; zbMATH DE number 4207226
• scientific article; zbMATH DE number 4137536

Cited in

(1)

• N-gram distribution and unification gain problem and its optimal solution

This page was built for publication: A Probabilistic Analysis for Greedy Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621317)