Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.
en iyi zamanda durma problemleri genellikle bir bellman denklemi biçiminde yazılabilir ve bu nedenle çoğu zaman dinamik programlama kullanılarak çözülür.
Faculty of Engineering and Natural Sciences Local and global sequence alignment using dynamic programming, scoring matrices (Pam, Blossum), multiple sequence alignment algorithms, database search algorithms (Blast, Fasta), distance matrices and construction of phylogenetic trees, motif determination.
Mühendislik ve Doğa Bilimleri Fakültesi Dinamik programlama, skor matriksleri (PAM, BLOSSUM) kullanılarak bölgesel ve global dizi eşleştirilmesi, çoğul dizi eşleştirme algoritmaları, veritabanı tarama algoritmaları (Blast, Fasta), uzaklık matriksleri, soyağacı yapılandırması ve motif belirleme çalışmaları.
Using dynamic programming to find an optimal solution.
Examples are used only to help you translate the word or expression searched in various contexts. They are not selected or validated by us and can contain inappropriate terms or ideas. Please report examples to be edited or not to be displayed. Potentially sensitive, inappropriate or colloquial translations are usually marked in red or in orange.
No results found for this meaning.
Synonyms and analogies of "using dynamic programming" in English