Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Seyed Naser Hashemi"'
Autor:
Malihe Niksirat, Seyed Naser Hashemi
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 2, Iss 1, Pp 109-115 (2021)
This paper considered the cost constrained vehicle scheduling problem under the constraint that the total number of vehicles is known in advance. Each depot has a different time processing cost. The goal of this problem is to find a feasible minimum
Externí odkaz:
https://doaj.org/article/14eeb57d6ec34d16a40f9d914f2354c0
Autor:
Ramin Yarinezhad, Seyed Naser Hashemi
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 1, Iss 2, Pp 145-152 (2020)
In this paper, we study the directed multicut and directed multimultiway cut problems. The input to the directed multi-multiway cut problem is a weighted directed graph $G=(V,E)$ and $k$ sets $S_1, S_2,\cdots, S_k$ of vertices. The goal is to find a
Externí odkaz:
https://doaj.org/article/d2762e109fd0469995c030d40fb878b0
Autor:
Mahdi Imanparast, Seyed Naser Hashemi
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 1, Iss 1, Pp 47-55 (2020)
Given a set $\mathcal P$ of $n$ points in the plane, the unit disk cover problem, which is known as an NP-hard problem, seeks to find the minimum number of unit disks that can cover all points of $\mathcal P$. We present a new $4$-approximation algor
Externí odkaz:
https://doaj.org/article/7cb39f4cc69f459abbb9d57efdd74bdf
Autor:
Seyed Naser Hashemi
Publikováno v:
مخاطرات محیط طبیعی, Vol 7, Iss 16, Pp 160-174 (2018)
The country of Iran is within one of the most seismically active regions of the world. In order to answer this question that how population centers in this country spatially correlate with seismicity hazardous zones, a GIS-based geospatial analysis t
Externí odkaz:
https://doaj.org/article/66af58670c9741ff815aca969939e8d6
Autor:
Ali Javinani, Zahra Javady Nejad, Farhad Gharibdoost, Ahmad Reza Jamshidi, Reza Atef Yekta, Saba Alvand, Vahide Imeni, Seyed Naser Hashemi, Hoda Kavosi
Publikováno v:
Journal of Tehran University Heart Center, Vol 14, Iss 1 (2019)
Background: Cardiac involvement, as one of the life-threatening manifestations of systemic sclerosis (SSc), is chiefly caused by collagen fiber deposition in the myocardium, which subsequently leads to conduction abnormalities. In the present study,
Externí odkaz:
https://doaj.org/article/676948054f3b444e9ee6ff5b53a125f6
Publikováno v:
Algorithms, Vol 6, Iss 3, Pp 396-406 (2013)
Rooted triplets are becoming one of the most important types of input for reconstructing rooted phylogenies. A rooted triplet is a phylogenetic tree on three leaves and shows the evolutionary relationship of the corresponding three species. In this p
Externí odkaz:
https://doaj.org/article/2ab59f9bdc3b4e84a8af40983b2130bb
Autor:
Seyed Naser Hashemi, Ramin Yarinezhad
Publikováno v:
Journal of Ambient Intelligence and Humanized Computing. 14:5941-5956
Sensor deployment is a fundamental issue in Wireless Sensor Networks (WSNs). Studies on the coverage problem are concentrated on deploying sensors to cover determined areas or a set of determined points (targets). On the other hand, the sensor networ
Autor:
Ramin Yarinezhad, Seyed Naser Hashemi
Publikováno v:
IET Communications. 14:580-587
Clustering is an effective method for improving the network lifetime and the overall scalability of a wireless sensor network. The problem of balancing the load of the cluster heads is called load-balanced clustering problem (LBCP), which is an NP-ha
Autor:
Seyed Naser Hashemi, Ramin Yarinezhad
Publikováno v:
Wireless Networks. 25:2901-2917
In a wireless sensor network (WSN), there is always the possibility of failure in sensor nodes. Quality of Service (QoS) of WSNs is highly degraded due to the faulty sensor nodes. One solution to this problem is to detect and reuse faulty sensor node
Autor:
Mahdi Imanparast, Seyed Naser Hashemi
Publikováno v:
The Journal of Supercomputing. 75:2648-2664
We study the problem of computing Euclidean minimum weight matching which investigates the minimum weight perfect matching in a complete geometric graph on a set of 2n points in the plane. We propose a simple randomized approximation algorithm based