Yüklüyor…
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given se...
Asıl Yazarlar: | AbouEisha, Hassan (Yazar), Amin, Talha (Yazar), Chikalov, Igor (Yazar), Hussain, Shahid (Yazar), Moshkov, Mikhail (Yazar) |
---|---|
Müşterek Yazar: | SpringerLink (Online service) |
Materyal Türü: | e-Kitap |
Dil: | İngilizce |
Baskı/Yayın Bilgisi: |
Cham :
Springer International Publishing : Imprint: Springer,
2019.
|
Edisyon: | 1st ed. 2019. |
Seri Bilgileri: | Intelligent Systems Reference Library,
146 |
Konular: | |
Online Erişim: | Full-text access OPAC'ta görüntüle |
Benzer Materyaller
-
Granular-Relational Data Mining How to Mine Relational Data in the Paradigm of Granular Computing? /
Yazar:: Hońko, Piotr
Baskı/Yayın Bilgisi: (2017) -
5th International Symposium on Data Mining Applications
Baskı/Yayın Bilgisi: (2018) -
Recent Advances on Soft Computing and Data Mining Proceedings of the Third International Conference on Soft Computing and Data Mining (SCDM 2018), Johor, Malaysia, February 06-07, 2018 /
Baskı/Yayın Bilgisi: (2018) -
Behavioral Program Synthesis with Genetic Programming
Yazar:: Krawiec, Krzysztof
Baskı/Yayın Bilgisi: (2016) -
Constraint Programming and Decision Making: Theory and Applications
Baskı/Yayın Bilgisi: (2018)