default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHassan Ismkhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Hassan Ismkhan
, Mohammad Izadi:
Proposing a Dimensionality Reduction Technique With an Inequality for Unsupervised Learning from High-Dimensional Big Data. IEEE Trans. Syst. Man Cybern. Syst. 53(6): 3880-3889 (2023)- 2022
- [j8]Hassan Ismkhan, Mohammad Izadi:
K-means-G*: Accelerating k-means clustering algorithm utilizing primitive geometric concepts. Inf. Sci. 618: 298-316 (2022)
2010 – 2019
- 2018
- [j7]Hassan Ismkhan:
Black box optimization using evolutionary algorithm with novel selection and replacement strategies based on similarity between solutions. Appl. Soft Comput. 64: 260-271 (2018) - [j6]Hassan Ismkhan:
I-k-means-+: An iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recognit. 79: 402-413 (2018) - 2017
- [j5]Hassan Ismkhan:
A.1D-C: A novel fast automatic heuristic to handle large-scale one-dimensional clustering. Appl. Soft Comput. 52: 1200-1209 (2017) - [j4]Hassan Ismkhan:
Effective three-phase evolutionary algorithm to handle the large-scale colorful traveling salesman problem. Expert Syst. Appl. 67: 148-162 (2017) - [j3]Hassan Ismkhan:
Effective heuristics for ant colony optimization to handle large-scale problems. Swarm Evol. Comput. 32: 140-149 (2017) - [i5]Hassan Ismkhan:
An initialization method for the k-means using the concept of useful nearest centers. CoRR abs/1705.03613 (2017) - 2016
- [j2]Hassan Ismkhan:
A Novel Intelligent Algorithm to Control Mutation Rate Using the Concept of Local Trap. New Gener. Comput. 34(1-2): 177-192 (2016) - 2015
- [i4]Hassan Ismkhan, Kamran Zamanifar:
Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem. CoRR abs/1504.02590 (2015) - 2014
- [j1]Hassan Ismkhan, Kamran Zamanifar:
Developing Programming Tools to Handle Traveling Salesman Problem by the Three Object-Oriented Languages. Appl. Comput. Intell. Soft Comput. 2014: 137928:1-137928:17 (2014) - [i3]Hassan Ismkhan:
Accelerating the ANT Colony Optimization By Smart ANTs, Using Genetic Operator. CoRR abs/1411.2897 (2014) - [i2]Hassan Ismkhan:
Using Ants as a Genetic Crossover Operator in GLS to Solve STSP. CoRR abs/1411.3277 (2014) - 2012
- [i1]Hassan Ismkhan, Kamran Zamanifar:
Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem. CoRR abs/1209.5339 (2012) - 2010
- [c1]Hassan Ismkhan, Kamran Zamanifar:
Using ants as a genetic crossover operator in GLS to solve STSP. SoCPaR 2010: 344-348
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 2024-04-25 05:40 CEST 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:
