book chapter · Lecture notes in computer science · 2013

A Dynamic Programming Algorithm for Learning Chain Event Graphs

Cited by 25Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Silander, T., & Leong, T.-Y. (2013). A Dynamic Programming Algorithm for Learning Chain Event Graphs. Lecture notes in computer science, 201–216. https://doi.org/10.1007/978-3-642-40897-7_14

MLA 9

Silander, Tomi, and Tze-Yun Leong. “A Dynamic Programming Algorithm for Learning Chain Event Graphs.” Lecture notes in computer science, 2013, pp. 201–16, https://doi.org/10.1007/978-3-642-40897-7_14.

Chicago

Silander, Tomi, and Tze-Yun Leong. 2013. “A Dynamic Programming Algorithm for Learning Chain Event Graphs.” Lecture notes in computer science: 201–16. https://doi.org/10.1007/978-3-642-40897-7_14.

Harvard

Silander, T. and Leong, T.-Y. (2013) ‘A Dynamic Programming Algorithm for Learning Chain Event Graphs’, Lecture notes in computer science, pp. 201–216. Available at: https://doi.org/10.1007/978-3-642-40897-7_14.

BibTeX

@incollection{silander2013dynamic,
  title = {{A Dynamic Programming Algorithm for Learning Chain Event Graphs}},
  author = {Silander, Tomi and Leong, Tze-Yun},
  booktitle = {Lecture notes in computer science},
  pages = {201--216},
  year = {2013},
  doi = {10.1007/978-3-642-40897-7_14}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.