找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 28426|回復(fù): 64
樓主
發(fā)表于 2025-3-21 17:44:06 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
編輯Hassan AbouEisha,Talha Amin,Mikhail Moshkov
視頻videohttp://file.papertrans.cn/320/319856/319856.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining網(wǎng)絡(luò)公開度




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining被引頻次




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining被引頻次學(xué)科排名




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




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining年度引用學(xué)科排名




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining讀者反饋




書目名稱Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 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.
地板
發(fā)表于 2025-3-22 06:30:29 | 只看該作者
5#
發(fā)表于 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.
6#
發(fā)表于 2025-3-22 15:54:24 | 只看該作者
7#
發(fā)表于 2025-3-22 20:12:01 | 只看該作者
8#
發(fā)表于 2025-3-22 23:18:12 | 只看該作者
9#
發(fā)表于 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
10#
發(fā)表于 2025-3-23 07:01:05 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-28 01:45
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
平江县| 繁昌县| 博兴县| 合水县| 佳木斯市| 巴南区| 内江市| 东丰县| 大余县| 赣榆县| 梅河口市| 堆龙德庆县| 商水县| 普陀区| 大足县| 宜昌市| 中西区| 彩票| 内丘县| 英吉沙县| 泸溪县| 文山县| 寻甸| 金山区| 松江区| 淮南市| 昆山市| 璧山县| 分宜县| 和平县| 渝北区| 七台河市| 安国市| 武定县| 临潭县| 乌拉特中旗| 宜昌市| 寻甸| 浪卡子县| 临高县| 万州区|