Zobrazeno 1 - 10
of 1 471
pro vyhledávání: '"covering problem"'
Publikováno v:
Известия Иркутского государственного университета: Серия "Математика", Vol 48, Iss 1, Pp 34-48 (2024)
The article concerns the problem of covering the lateral surface of a right circular cylinder or a cone with equal balls. The surface is required to belong to their union, and the balls’ radius is minimal. The centers of the balls must lie on the c
Externí odkaz:
https://doaj.org/article/27bfd9ee4e7d400d927380d3125299cf
Autor:
Sisca Octarina, Putra Bahtera Jaya Bangun, Endro Setyo Cahyono, Bambang Suprihatin, Ita Sarjani, Fitri Maya Puspita, Evi Yuliza
Publikováno v:
Science and Technology Indonesia, Vol 9, Iss 2, Pp 260-272 (2024)
The increasing population has resulted in a significant increase in the amount of waste. One effort that can be made to overcome the waste problem is to provide a Temporary Waste Disposal Site (TWDS). This research aims to optimize the TWDS in the Bu
Externí odkaz:
https://doaj.org/article/6496a4f22e6249e98cf5c61fc9283763
Autor:
Fernando Lepe-Silva, Broderick Crawford, Felipe Cisternas-Caneo, José Barrera-Garcia, Ricardo Soto
Publikováno v:
Mathematics, Vol 12, Iss 20, p 3171 (2024)
This research presents a novel hybrid approach, which combines the White Shark Optimizer (WSO) metaheuristic algorithm with chaotic maps integrated into the binarization process. Inspired by the predatory behavior of white sharks, WSO has shown great
Externí odkaz:
https://doaj.org/article/d1a265e81b204419b8bdbf82ab92c654
Autor:
Fitri Maya Puspita, Sisca Octarina, Laila Hanum, Chatrin Yohana Simamora, Helena Valenta Br Kemit, Evi Yuliza
Publikováno v:
Science and Technology Indonesia, Vol 8, Iss 2, Pp 184-194 (2023)
This study discusses Set Covering Problem (SCP) in designing the optimal temporary waste disposal site (TWDS) in Semambu Island Village using the Myopic Algorithm (MA) and Greedy Reduction Algorithm (GRA). The analysis was carried out and compared us
Externí odkaz:
https://doaj.org/article/ff6dcc31c7c04e94b41bbe0a5682e169
Publikováno v:
Biomimetics, Vol 9, Iss 5, p 283 (2024)
The set-covering problem aims to find the smallest possible set of subsets that cover all the elements of a larger set. The difficulty of solving the set-covering problem increases as the number of elements and sets grows, making it a complex problem
Externí odkaz:
https://doaj.org/article/0812a8366ecc4af3aada3cc0fe454ebd
Publikováno v:
Data Technologies and Applications, 2022, Vol. 56, Issue 5, pp. 762-781.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/DTA-08-2021-0205
Publikováno v:
Lietuvos Matematikos Rinkinys, Vol 46, Iss spec. (2023)
The analysis of ACO algorithm for transmitters locating problem is presented in this paper.
Externí odkaz:
https://doaj.org/article/8dcc968eaaef427ba7d313247b9467e2
Publikováno v:
Axioms, Vol 13, Iss 2, p 132 (2024)
In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. and Y
Externí odkaz:
https://doaj.org/article/cbf444e455a241b6ac1c2da03195f0b6
Publikováno v:
Axioms, Vol 13, Iss 1, p 13 (2023)
In this study, we employ a dual-objective optimization model, utilizing the Implicit Modified Coverage Location Problem (MCLP-Implicit) approach, to determine an appropriate fire station allocation. Our objectives encompass maximizing coverage in are
Externí odkaz:
https://doaj.org/article/19ac941f8bd74f07b7ddc2592ad50257
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.