default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSasan Harifi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Sasan Harifi
, Amirmasoud Razavi, Melika Heydari Rad, Alireza Moradi:
A Giza Pyramids Construction metaheuristic approach based on upper bound calculation for solving the network reliability problem. Appl. Soft Comput. 167: 112241 (2024)- 2023
- [j11]Sasan Harifi, Madjid Khalilian, Javad Mohammadzadeh:
Swarm based automatic clustering using nature inspired Emperor Penguins Colony algorithm. Evol. Syst. 14(6): 1083-1099 (2023) - [j10]Mahsa Zahiri, Javad Mohammadzadeh, Sasan Harifi:
An improved Girvan-Newman community detection algorithm using trust-based centrality. J. Ambient Intell. Humaniz. Comput. 14(4): 3755-3766 (2023) - [j9]Sasan Harifi, Reza Mohamaddoust:
Zigzag mutation: a new mutation operator to improve the genetic algorithm. Multim. Tools Appl. 82(29): 45411-45432 (2023) - 2022
- [j8]Sadoullah Ebrahimnejad, Sasan Harifi:
An optimized evacuation model with compatibility constraints in the context of disability: an ancient-inspired Giza Pyramids Construction metaheuristic approach. Appl. Intell. 52(13): 15040-15073 (2022) - [j7]Sasan Harifi:
A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem. Soft Comput. 26(22): 12761-12778 (2022) - 2021
- [j6]Sasan Harifi, Javad Mohammadzadeh, Madjid Khalilian, Sadoullah Ebrahimnejad:
Giza Pyramids Construction: an ancient-inspired metaheuristic algorithm for optimization. Evol. Intell. 14(4): 1743-1761 (2021) - [j5]Sasan Harifi, Madjid Khalilian, Javad Mohammadzadeh, Sadoullah Ebrahimnejad:
Optimization in solving inventory control problem using nature inspired Emperor Penguins Colony algorithm. J. Intell. Manuf. 32(5): 1361-1375 (2021) - [j4]Sasan Harifi, Javad Mohammadzadeh, Madjid Khalilian, Sadoullah Ebrahimnejad:
Hybrid-EPC: an Emperor Penguins Colony algorithm with crossover and mutation operators and its application in community detection. Prog. Artif. Intell. 10(2): 181-193 (2021) - 2020
- [j3]Sasan Harifi, Madjid Khalilian, Javad Mohammadzadeh, Sadoullah Ebrahimnejad:
Using Metaheuristic Algorithms to Improve k-Means Clustering: A Comparative Study. Rev. d'Intelligence Artif. 34(3): 297-305 (2020) - [j2]Sasan Harifi, Madjid Khalilian, Javad Mohammadzadeh, Sadoullah Ebrahimnejad:
Optimizing a Neuro-Fuzzy System Based on Nature-Inspired Emperor Penguins Colony Optimization Algorithm. IEEE Trans. Fuzzy Syst. 28(6): 1110-1124 (2020) - [i1]Mohammad Moradi, Elham Ghanbari, Mehrdad Maeen, Sasan Harifi:
An approach based on Combination of Features for automatic news retrieval. CoRR abs/2004.11699 (2020)
2010 – 2019
- 2019
- [j1]Sasan Harifi, Madjid Khalilian, Javad Mohammadzadeh, Sadoullah Ebrahimnejad:
Emperor Penguins Colony: a new metaheuristic algorithm for optimization. Evol. Intell. 12(2): 211-226 (2019) - 2017
- [c1]Sasan Harifi, Ebrahim Byagowi, Madjid Khalilian:
Comparative Study of Apache Spark MLlib Clustering Algorithms. DMBD 2017: 61-73
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
