Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Hassan AbouEisha"'
Publikováno v:
Intelligent Systems Reference Library ISBN: 9783319918389
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5116ab6872c721dd234119f14bde78c
https://doi.org/10.1007/978-3-319-91839-6
https://doi.org/10.1007/978-3-319-91839-6
Autor:
Victor Zamaraev, Jérôme Monnot, Shahid Hussain, Bernard Ries, Vadim V. Lozin, Hassan AbouEisha
Publikováno v:
ALGORITHMICA
Algorithmica
Algorithmica, 2018, 80 (10), ⟨10.1007/s00453-017-0346-9⟩
Algorithmica
Algorithmica, 2018, 80 (10), ⟨10.1007/s00453-017-0346-9⟩
The results of this paper previously appeared as extended abstracts in proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, and the 27th International Workshop on Combinatorial Algorithms, IWOCA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6880f283d90292edcbb2a224ee16209
http://livrepository.liverpool.ac.uk/3059778/1/up-tcs_rev.pdf
http://livrepository.liverpool.ac.uk/3059778/1/up-tcs_rev.pdf
Publikováno v:
Discrete Applied Mathematics. 204:203-207
We prove that the minimum average depth of a decision tree for sorting 8 pairwise different elements is equal to 620160 / 8 ! . We show also that each decision tree for sorting 8 elements, which has minimum average depth (the number of such trees is
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
In 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 improve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5117d3d433ba0ed66f50a99b01bd7b8d
https://doi.org/10.1007/978-3-319-91839-6_5
https://doi.org/10.1007/978-3-319-91839-6_5
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
In this chapter, we describe main notions related to decision tables, consider the structure of subtables of a given decision table represented as a directed acyclic graph (DAG), and discuss time complexity of algorithms on DAGs. We also consider cla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee3a17cc54dedf7764c86b0c231beb41
https://doi.org/10.1007/978-3-319-91839-6_3
https://doi.org/10.1007/978-3-319-91839-6_3
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
This chapter starts by formally defining the class of meshes under study. We describe the notion of element partition tree and present an abstract way of defining optimization criteria of element partition trees in terms of cost functions. A definiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50cfde72db85ee1b63a73e41920bde1e
https://doi.org/10.1007/978-3-319-91839-6_13
https://doi.org/10.1007/978-3-319-91839-6_13
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
In this chapter, we consider different kinds of decision trees, including approximate decision trees and decision trees irredundant relative to two types of decision tree uncertainty. We describe the set of decision trees corresponding to a subgraph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de252bc853fcf2ba7923eb7c18e855d8
https://doi.org/10.1007/978-3-319-91839-6_4
https://doi.org/10.1007/978-3-319-91839-6_4
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
Decision rules can be characterized by many parameters. This chapter presents a dynamic programming algorithm that can sequentially optimize decision rules with respect to multiple criteria. In some cases, we can find decision rules that are simultan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a89cad9ede4405458d61007796e0a09f
https://doi.org/10.1007/978-3-319-91839-6_10
https://doi.org/10.1007/978-3-319-91839-6_10
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
In this chapter, we consider an algorithm which constructs the sets of Pareto optimal points for bi-criteria optimization problems for decision trees relative to two cost functions. We also show how the constructed set of Pareto optimal points can be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a1eb612d47ecb196298222c9f195a8e
https://doi.org/10.1007/978-3-319-91839-6_7
https://doi.org/10.1007/978-3-319-91839-6_7
Publikováno v:
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining ISBN: 9783319918389
This chapter presents algorithm for finding Pareto optimal points corresponding to Pareto optimal element partition trees, and it suggests different applications of this algorithm.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10f4158a0e24861891d42dfecb92e900
https://doi.org/10.1007/978-3-319-91839-6_15
https://doi.org/10.1007/978-3-319-91839-6_15