Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining - Shahid Hussain,Igor Chikalov,Hassan Aboueisha,Mikhail Moshkov,Talha Amin

Anglų
2019-01-25
120,11 € 184,78 €

-35% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 12-18 d.d.

30 dienų grąžinimo politika

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 set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of obj ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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 set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.

Daugiau informacijos

Autorius Shahid Hussain, Igor Chikalov, Hassan Aboueisha, Mikhail Moshkov, Talha Amin
Leidėjas Springer International Publishing
Series Intelligent Systems Reference Library
Išleidimo metai 2019
Viršelio tipas Minkšti viršeliai
EAN 9783030063092
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Jūsų įvertinimas:

Goodreads Atsiliepimai

120,11 € 184,78 €