Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Presents different dynamic programming applications in the areas of (i) optimization of decision trees, (ii) optimization of decision rules and systems of decision rules, (iii) optimization of element partition trees, which are used in finite elem. Seller Inventory # 448669737

Contact seller

Buy New

� 80.13

Convert currency

Shipping: � 21.07

From Germany to United Kingdom

Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Hassan Aboueisha

Published by Springer International Publishing Jan 2019, 2019

ISBN 10: 3030063097 ISBN 13: 9783030063092

New Taschenbuch

Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 296 pp. Englisch. Seller Inventory # 9783030063092

Contact seller

Buy New

� 92.91

Convert currency

Shipping: � 9.27

From Germany to United Kingdom

Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Hassan Aboueisha

Published by Springer International Publishing, Springer International Publishing, 2019

ISBN 10: 3030063097 ISBN 13: 9783030063092

New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783030063092

Contact seller