Metraipolis › archive › dc_ccf115d0b351

A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements — Europe PMC PMID:36832617

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/36832617
DOI
10.3390/e25020251
License (as archived)
solo-consultazione
Archived
2026-10-06T11:14:48.569Z
SHA-256 of the archived text
57fecef25ab4800d853f2f03da42f2409fa053272b50690170c9c526e05cbb51
Stable URL of this page
https://metraipolis.com/documento/dc_ccf115d0b351

How to cite

A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements — Europe PMC PMID:36832617 — Europe PMC (en), https://europepmc.org/article/MED/36832617 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_ccf115d0b351 (Metraipolis archive dc_ccf115d0b351, sha256 57fecef25ab4800d853f2f03da42f2409fa053272b50690170c9c526e05cbb51)
BibTeX
@misc{dcccf115d0b351,
  title = {A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements — Europe PMC PMID:36832617},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/36832617},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_ccf115d0b351; sha256 57fecef25ab4800d853f2f03da42f2409fa053272b50690170c9c526e05cbb51},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/36832617. Agents can read the archived copy with the MCP tool read_document.