Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Fidan Nuriyeva"'
Autor:
Fidan Nuriyeva, Hakan Kutucu
Publikováno v:
Engineering Science and Technology, an International Journal, Vol 61, Iss , Pp 101918- (2025)
This paper introduces a novel algorithm for computing the convex hull of a finite set of points in two-dimensional space. Unlike traditional methods, this algorithm strategically partitions the input set into five distinct regions, isolating interior
Externí odkaz:
https://doaj.org/article/f08da80eecce4c7abe3da12783ffb2ab
Autor:
Polat İpek, Mehmet Nuri Atalar, Ayşe Baran, Mehmet Fırat Baran, Mohammad Mehdi Ommati, Musa Karadag, Murat Zor, Aziz Eftekhari, Mehmet Hakkı Alma, Khaled Zoroufchi Benis, Fidan Nuriyeva, Rovshan Khalilov
Publikováno v:
Heliyon, Vol 10, Iss 6, Pp e27386- (2024)
The Allium turcicum L. (Zuzubak) plant as a cultivated vegetable have various health benefits and consumed as a food. Due to the shortcoming evidence in literature and the importance of this plant in folk medicine, in the present study, for the first
Externí odkaz:
https://doaj.org/article/1b0ec58a85a548d494929ac33f8ba267
Publikováno v:
Artificial Intelligence and Applied Mathematics in Engineering Problems ISBN: 9783030361778
International Conference on Artificial Intelligence and Applied Mathematics in Engineering (ICAIAME) -- APR 20-22, 2019 -- Antalya, TURKEY
The Boolean Knapsack Problem, which has numerous real life applications, is a combinatorial optimization p
The Boolean Knapsack Problem, which has numerous real life applications, is a combinatorial optimization p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3387d61c922dc5282ee435ca1655f063
https://doi.org/10.1007/978-3-030-36178-5_57
https://doi.org/10.1007/978-3-030-36178-5_57
Publikováno v:
IFAC-PapersOnLine. 51:268-270
This paper presents a self-organizing heuristic iterative algorithm for solving Travelling Salesman Problem. In the algorithm, firstly priority values of the edges are determined. Then, varied solutions are found. After that, the priority values of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dd4a3aa0645d6e4ba51fa4dc55c7e51
https://doi.org/10.1016/j.ifacol.2018.11.299
https://doi.org/10.1016/j.ifacol.2018.11.299
Autor:
Deniz Tanir, Fidan Nuriyeva
Publikováno v:
2017 International Conference on Computer Science and Engineering (UBMK).
Clustering is an important tool for analyzing gene expression data. Many clustering algorithms have been proposed for the analysis of gene expression data. In this article we have clustered real life gene expression data via K-Means which is one of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f575caa31eae5d61fd966a1623caf03f
https://doi.org/10.1109/ubmk.2017.8093520
https://doi.org/10.1109/ubmk.2017.8093520
Publikováno v:
2017 International Artificial Intelligence and Data Processing Symposium (IDAP).
Nowadays, compression of binary image is vital due to enormous amount of images that are being processed and stored in a wide range of applications such as text, maps, fingerprint etc. In this study, we proposed a new method for lossless compression
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8083aea2b16d4a681fe5d781c8b58454
https://doi.org/10.1109/idap.2017.8090198
https://doi.org/10.1109/idap.2017.8090198
Autor:
Fidan Nuriyeva, Deniz Tanir
EgeUn###
K-means clustering algorithm which is a process of separating n number of points into K clusters according to the predefined value of K is one of the clustering analysis algorithms. This algorithm has many applications in analysis of cl
K-means clustering algorithm which is a process of separating n number of points into K clusters according to the predefined value of K is one of the clustering analysis algorithms. This algorithm has many applications in analysis of cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b9afdcbfd9caf7f27dbe65463db108c
https://aperta.ulakbim.gov.tr/record/44001
https://aperta.ulakbim.gov.tr/record/44001
Autor:
Gozde Kizilates, Fidan Nuriyeva
Publikováno v:
Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Vol 20, Iss 2 (2016)
Volume: 20, Issue: 2
Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Volume: 20, Issue: 2
Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Bu makalede Gezgin Satıcı Problemi için yeni bir hipersezgisel algoritma önerilmiştir. Bu yöntemde önce N adet şehir içerisinden merkez şehir ve 4 uç şehir seçilip, sonra ise merkez ile ikişer-ikişer uç şehirlerin orta noktaları bel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6560406fa9e3bbeb470f4fa2f862798d
https://doi.org/10.19113/sdufbed.55498
https://doi.org/10.19113/sdufbed.55498
Autor:
Fidan Nuriyeva
In this paper, Generalized Sequential Partially Covering Problem is presented. A Binary Integer Linear Programming model of the problem is proposed and it is explained with an example. The model has been implemented in GAMS and solved using the CPLEX
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afbbe4928b19bd5bb64d3ed054eab22b
https://avesis.deu.edu.tr/publication/details/92c332f2-1d6d-472f-929f-da3a67f69e97/oai
https://avesis.deu.edu.tr/publication/details/92c332f2-1d6d-472f-929f-da3a67f69e97/oai
Publikováno v:
Optimization. 61:477-488
In this study one-dimensional knapsack problems (KP), which have many applications in technical and economic areas, are studied; then greedy algorithms are discussed for these problems. Guarantee values of these algorithms are calculated in order to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::164abee08ed9cd0f5a664063523c4acc
https://doi.org/10.1080/02331934.2011.617818
https://doi.org/10.1080/02331934.2011.617818