Cargando…
A Dynamic Programming Algorithm for Finding an Optimal Sequence of Informative Measurements
An informative measurement is the most efficient way to gain information about an unknown state. We present a first-principles derivation of a general-purpose dynamic programming algorithm that returns an optimal sequence of informative measurements by sequentially maximizing the entropy of possible...
Autores principales: | Loxley, Peter N., Cheung, Ka-Wai |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9955913/ https://www.ncbi.nlm.nih.gov/pubmed/36832617 http://dx.doi.org/10.3390/e25020251 |
Ejemplares similares
-
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
por: Eddy, Sean R
Publicado: (2002) -
COSMO: A dynamic programming algorithm for multicriteria codon optimization
por: Taneda, Akito, et al.
Publicado: (2020) -
An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
por: Pozhitkov, Alexander E, et al.
Publicado: (2002) -
Optimal Quadratic Programming Algorithms
por: Dostal, Zdenek
Publicado: (2009) -
A Mode of Intelligent Equipment Monitoring Optimization Based on Dynamic Programming Algorithm
por: Zheng, Zhilei, et al.
Publicado: (2022)