找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining; Hassan AbouEisha,Talha Amin,Mikhail Moshkov Book 2019 Sp

[复制链接]
查看: 28400|回复: 64
发表于 2025-3-21 17:44:06 | 显示全部楼层 |阅读模式
书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
编辑Hassan AbouEisha,Talha Amin,Mikhail Moshkov
视频video
概述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
丛书名称Intelligent Systems Reference Library
图书封面Titlebook: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining;  Hassan AbouEisha,Talha Amin,Mikhail Moshkov Book 2019 Sp
描述.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. Th
出版日期Book 2019
关键词Dynamic Programming; Pareto Optimal Points; Bi-criteria Optimization Problem; Matrix Chain Multiplicati
版次1
doihttps://doi.org/10.1007/978-3-319-91839-6
isbn_softcover978-3-030-06309-2
isbn_ebook978-3-319-91839-6Series ISSN 1868-4394 Series E-ISSN 1868-4408
issn_series 1868-4394
copyrightSpringer International Publishing AG, part of Springer Nature 2019
The information of publication is updating

书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining影响因子(影响力)




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining影响因子(影响力)学科排名




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining网络公开度




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining网络公开度学科排名




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining被引频次




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining被引频次学科排名




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining年度引用




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining年度引用学科排名




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining读者反馈




书目名称Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:49:43 | 显示全部楼层
In-store Mobile Marketing-KommunikationIn this chapter, we consider tools (statements and algorithms) which are used for the study of Pareto optimal points for bi-criteria optimization problems related to decision trees, decision rules, decision rule systems, and element partition trees.
发表于 2025-3-22 00:33:19 | 显示全部楼层
InSAR Observations of Ground DeformationIn this chapter, we consider multi-stage optimization technique for decision trees and two of its applications: study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, and improvement of bounds on depth of decision trees for diagnosis of circuits.
发表于 2025-3-22 06:30:29 | 显示全部楼层
发表于 2025-3-22 10:09:47 | 显示全部楼层
Introduction,This chapter discusses the extensions of dynamic programming developed in the book, four main directions of the study, applications, and the structure of the book.
发表于 2025-3-22 15:54:24 | 显示全部楼层
发表于 2025-3-22 20:12:01 | 显示全部楼层
发表于 2025-3-22 23:18:12 | 显示全部楼层
发表于 2025-3-23 02:36:06 | 显示全部楼层
Hassan AbouEisha,Talha Amin,Mikhail MoshkovPresents 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
发表于 2025-3-23 07:01:05 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 06:15
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表