Loading…
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...
Main Authors: | AbouEisha, Hassan (Author), Amin, Talha (Author), Chikalov, Igor (Author), Hussain, Shahid (Author), Moshkov, Mikhail (Author) |
---|---|
Corporate Author: | SpringerLink (Online service) |
Format: | e-Book |
Language: | English |
Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2019.
|
Edition: | 1st ed. 2019. |
Series: | Intelligent Systems Reference Library,
146 |
Subjects: | |
Online Access: | Full-text access View in OPAC |
Similar Items
-
Granular-Relational Data Mining How to Mine Relational Data in the Paradigm of Granular Computing? /
by: Hońko, Piotr
Published: (2017) -
5th International Symposium on Data Mining Applications
Published: (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 /
Published: (2018) -
Behavioral Program Synthesis with Genetic Programming
by: Krawiec, Krzysztof
Published: (2016) -
Constraint Programming and Decision Making: Theory and Applications
Published: (2018)