Articles liés à Extensions of Dynamic Programming for Combinatorial...
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining - Couverture rigide
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 92,27
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Extensions of Dynamic Programming for Combinatorial...
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Edité par
Springer International Publishing, 2018
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 220546698
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Edité par
Springer International Publishing, 2018
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783319918389
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Edité par
Springer International Publishing Mai 2018, 2018
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783319918389
Quantité disponible : 2 disponible(s)
Image d'archives
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library, 146)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783319918389_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 296 pp. Englisch. N° de réf. du vendeur 9783319918389
Quantité disponible : 2 disponible(s)
Image d'archives
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 32753298-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Edité par
Springer, 2018
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 32753298
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Edité par
Springer, 2018
ISBN 10 : 3319918389
ISBN 13 : 9783319918389
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 32753298
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 32753298-n
Quantité disponible : Plus de 20 disponibles
Image d'archives
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library (146))
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 26380236596
Quantité disponible : 4 disponible(s)