Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Mara Hajdu-Macelaru"'
Autor:
Cristina Ticala, Camelia-M. Pintea, Simone A. Ludwig, Mara Hajdu-Macelaru, Oliviu Matei, Petrica C. Pop
Publikováno v:
2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5556139b13f7c902c957c4416169def6
https://doi.org/10.1109/fuzz-ieee55066.2022.9882851
https://doi.org/10.1109/fuzz-ieee55066.2022.9882851
Autor:
Cristina Ticala, Camelia-M. Pintea, Gloria Cerasela Crisan, Oliviu Matei, Mara Hajdu-Macelaru, Petrica C. Pop
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031154706
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19fb41dfeb526095407311a1a1af0ce4
https://doi.org/10.1007/978-3-031-15471-3_39
https://doi.org/10.1007/978-3-031-15471-3_39
Autor:
Ioana Zelina, Mara Hajdu-Macelaru
Publikováno v:
Creative Mathematics and Informatics. 27:31-35
Just about everything changes, and so should a software quality model in order to provide a better understanding of quality for any software product to which is applied. But how can we develop such a software quality model? A software quality model p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62a495cd03d0a06d972e5a68c6ba5c92
https://doi.org/10.37193/cmi.2018.01.05
https://doi.org/10.37193/cmi.2018.01.05
Publikováno v:
Creative Mathematics and Informatics. 27:95-100
The hypercube is one of the best model for the network topology of a distributed system. In this paper we determine the cube polynomial of Extended Fibonacci Cubes, which is the counting polynomial for the number of induced k-dimensional hypercubes i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d52ec8b2d2e69a464e8d987aa518ffa
https://doi.org/10.37193/cmi.2018.01.13
https://doi.org/10.37193/cmi.2018.01.13
An efficient Reverse Distribution System for solving sustainable supply chain network design problem
Publikováno v:
Journal of Applied Logic. 13:105-113
This paper deals with a sustainable supply chain network design problem (SSCNDP) arising in the public sector. In the considered SSCNDP, given a manufacturer, a set of m potential distribution centers (DCs) having a given distinct capacity, and a set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64cdebd8ab4105116414e6da1f8edb85
https://doi.org/10.1016/j.jal.2014.11.004
https://doi.org/10.1016/j.jal.2014.11.004
Publikováno v:
Business Information Systems Workshops ISBN: 9783319524634
BIS (Workshops)
BIS (Workshops)
The application of Semantic Web technologies has the potential to overcome the limitations of classic WWW architectures and can be used to build Web portals with enhanced semantic interoperability. This paper proposes an innovative approach to implem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c95a610ef49bb58cdccdd34473b5513
https://doi.org/10.1007/978-3-319-52464-1_5
https://doi.org/10.1007/978-3-319-52464-1_5
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783642329210
SOCO
SOCO
Nowadays the efforts of humanity to keep the planet safe are considerable. This aspect is reflected in everyday problems, including the minimization of vehicle’s air pollution. In order to keep a green planet, in particular transportation problems,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffe2b15f5abe144d5997c3cd604054d1
https://doi.org/10.1007/978-3-642-32922-7_46
https://doi.org/10.1007/978-3-642-32922-7_46
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642289415
HAIS (1)
HAIS (1)
Some of the most complex problems, nowadays, are transportation problems. A capacitated fixed-charge transportation problem is the problem we are trying to solve using hybrid classical approaches. The problem is considered with fixed capacities for e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33eab571dde4ca165dbf490ef78f5e19
https://doi.org/10.1007/978-3-642-28942-2_50
https://doi.org/10.1007/978-3-642-28942-2_50
Publikováno v:
International Journal of Advanced Intelligence Paradigms. 4:268
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items, into a mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a50af485645a7d9bd72dd11ae61fb0d9
https://doi.org/10.1504/ijaip.2012.052071
https://doi.org/10.1504/ijaip.2012.052071