Solving Stochastic Shortest Path Problem Using Monte Carlo Sampling Method: A Distributed Learning Automata Approach

  • Meybodi M
  • Beigy H
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Meybodi, M. R., & Beigy, H. (2003). Solving Stochastic Shortest Path Problem Using Monte Carlo Sampling Method: A Distributed Learning Automata Approach. In Neural Networks and Soft Computing (pp. 626–631). Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-1902-1_96

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free