Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Eskandari, Marzieh"'
The purpose of the current study is to investigate a special case of art gallery problem, namely Sculpture Garden Problem. In the said problem, for a given polygon $P$, the ultimate goal is to place the minimum number of guards to define the interior
Externí odkaz:
http://arxiv.org/abs/2107.08175
We study a generalization of $k$-center clustering, first introduced by Kavand et. al., where instead of one set of centers, we have two types of centers, $p$ red and $q$ blue, and where each red center is at least $\alpha$ distant from each blue cen
Externí odkaz:
http://arxiv.org/abs/2107.07914
Publikováno v:
Salmand: Iranian Journal of Ageing; Autumn2024, Vol. 19 Issue 3, p438-451, 14p
Autor:
Eskandari, Marzieh1,2 (AUTHOR) marzieh.eskandari@njit.edu, Khare, Bhavika B.3 (AUTHOR), Kumar, Nirman3 (AUTHOR), Sadeghi Bigham, Bahram2,4 (AUTHOR)
Publikováno v:
Mathematics (2227-7390). Feb2023, Vol. 11 Issue 3, p748. 17p.
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.
Publikováno v:
In Journal of Computational Science May 2012 3(3):127-131
Voronoi game is a simple geometric model for competitive facility location problem that is done between two players in continues space. In some previous researches the problem has been studied with Euclidean distance. In this paper a new version of o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::250e2ee7ae8d24641737c98827efe1e8
Autor:
Eskandari, Marzieh, Torabi, Farshad
Problem Based Learning (PBL) is an instructional student-centered approach that empowers learners to conduct research, integrate theory and practice, and apply knowledge and skills to develop a viable solution to a real-world problem as opposed to di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::342101fa0a64708b99897072bfa10e24
Given a set 𝑆 of 𝑛 points in the plane and a constant 𝛼,(𝑛, 1, 1, 𝛼)-center problem is to find two closed disks which each covers the whole 𝑆, the diameter of the bigger one is minimized, and the distance of the two centers is at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24a28c504b27fab3d668c7c40294ebd6
In this paper, the problem of finding the minimum number of -modems to cover a monotone polygon is considered. A -modem is a point guard which can see a point, if the line segment joining them crosses at most edges of the polygon. The parameter is re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b25674a653ad0dc12f915c6a5b5ed35e