Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Daria Zaruba"'
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9789813369801
The article is concerned with one of the possible hybrid approaches to combinatorial and logic graph problems. They belong to the class of NP-hard optimizations problems. The authors have suggested a hybrid approach to solve these issues more effecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a91932c629e21bb8488d8ed4d4a994c5
https://doi.org/10.1007/978-981-33-6981-8_4
https://doi.org/10.1007/978-981-33-6981-8_4
Publikováno v:
2020 International Russian Automation Conference (RusAutoCon).
The article deals with main terms of decision support systems based on self-organization. Moreover, the maincomponents and algorithms used in these systems have been described. The authors have provided a structure of the decision support system and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7e243600d223f885587737aed27e945
https://doi.org/10.1109/rusautocon49822.2020.9208146
https://doi.org/10.1109/rusautocon49822.2020.9208146
Publikováno v:
EWDTS
The article considers the modelling of a computational device at the design stage. One of the most labour-intensive problems is a partitioning problem which belongs to the class of NP-hard problems. In other words, there is no precise method for its
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::666594350083300a9942e2e309c64ff1
https://doi.org/10.1109/ewdts50664.2020.9225027
https://doi.org/10.1109/ewdts50664.2020.9225027
Autor:
Vladimir Kureichik, Daria Zaruba
Publikováno v:
2019 International Russian Automation Conference (RusAutoCon).
The paper deals with one of the key engineering design problem - an electroniccomputer equipment partitioning. The partitioning problem belongs to the class of NP-complex and NP-hard problems. The problem is defined as a partition of a graph into par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8e4de826b05aef69b7788bad405f655
https://doi.org/10.1109/rusautocon.2019.8867613
https://doi.org/10.1109/rusautocon.2019.8867613
Publikováno v:
2019 International Russian Automation Conference (RusAutoCon).
The paper deals with a hybrid algorithm to solve one of the main problem of the VLSI design - the placement problem. This problem is NP-complete and does not have a deterministic algorithm for its solution. Hence, the development of new search method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c415bae06c2dfabfe8fb042de430a44
https://doi.org/10.1109/rusautocon.2019.8867633
https://doi.org/10.1109/rusautocon.2019.8867633
Publikováno v:
2019 International Seminar on Electron Devices Design and Production (SED).
The paper is devoted to the solution of one of the main microelectronics design problem in the design stage – a partitioning of ECE elements. The quality of solution directly affects the subsequent interconnection traceability and, as a result, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc2cdeb6d2ba78a428351552a2265aef
https://doi.org/10.1109/sed.2019.8798435
https://doi.org/10.1109/sed.2019.8798435
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319911885
CSOS (2)
CSOS (2)
The paper considers one of the most important problem of resource allocation – packing of units within 2D space. The problem is NP-hard. A problem formulation is made, as well as restrictions and boundary conditions are found out. To solve the cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50aaa768608e4b15ab4187dc0a143576
https://doi.org/10.1007/978-3-319-91189-2_5
https://doi.org/10.1007/978-3-319-91189-2_5
Autor:
Daria Zaruba, Dmitry Zaporozhets
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319683201
The paper deals with one of the most significant problem of computer design – a VLSI placement problem. The authors prove a relevance of new heuristic methods for the given problem. The VLSI placement problem is formulated and an optimization crite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af1e3d4fe53350188f17e46a9aa0aa0a
https://doi.org/10.1007/978-3-319-68321-8_35
https://doi.org/10.1007/978-3-319-68321-8_35
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319683201
The paper considers one of the most important problem in the design field – VLSI fragments placement within restricted construction area. The VLSI fragments placement problem is NP-hard and complex problem. In the work there are presented a descrip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dcfd94c8732566c021cbfaf8dc5fbf1
https://doi.org/10.1007/978-3-319-68321-8_36
https://doi.org/10.1007/978-3-319-68321-8_36
Autor:
Vladimir Kureichik, Daria Zaruba
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319572604
CSOC (1)
CSOC (1)
The paper discusses hybrid algorithm based on the elements grouping for the graph partitioning problem which is one of the most important optimization problem in the decision making. This problem belongs to the NP-class problem that is there are no p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9ede0cc03c7ea2f50c7e8f837f130a7
https://doi.org/10.1007/978-3-319-57261-1_7
https://doi.org/10.1007/978-3-319-57261-1_7