EUVIMEDEUVIMED entdecken
Crossref

Graph planning with expected finite horizon

Krishnendu Chatterjee, Laurent Doyen

Journal of Computer and System Sciences · 2022-11 · 129 · 1-21

DOI: 10.1016/j.jcss.2022.04.003 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2022-11. Verfasst von Krishnendu Chatterjee und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: FP7 Ideas: European Research Council, European Research Council, Austrian Science Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • FP7 Ideas: European Research Council
  • European Research Council
  • Austrian Science Fund

Zitieren

APA

Chatterjee, K., & Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences, 129, 1-21. https://doi.org/10.1016/j.jcss.2022.04.003

Vancouver

Chatterjee K, Doyen L. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 2022;129:1-21. doi:10.1016/j.jcss.2022.04.003

BibTeX
@article{Chatterjee2022,
  author = {Chatterjee, Krishnendu and Doyen, Laurent},
  title = {Graph planning with expected finite horizon},
  journal = {Journal of Computer and System Sciences},
  year = {2022},
  volume = {129},
  pages = {1--21},
  doi = {10.1016/j.jcss.2022.04.003}
}
Kostenlos starten →