activity
20122026
most citedDeveloping Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

9 citations · 11 across the 7 of their papers we have counts for

collaborators

7 papers

cs.LG2026

Unsupervised Learning for Missing Modalities in Multimodal Learning

Hassan Ismkhan, Hamid Bouchahcia

This paper addresses the missing-modality challenge in multi-modal learning by introducing Unsupervised Learning for Missing Modalities in Multi-Modal Learning (UL4M4), a flexible…

cs.RO2026

Reinforcement Learning-Guided Retrieval with Soft Fusion for Robust Multimodal Imitation Learning under Missing Modalities

Hassan Ismkhan, Hamid Bouchahcia

Robotic systems perceive the world through multiple input modalities -- including visual camera streams and natural language instructions -- and must select appropriate actions bas…

cs.LG2017★ 2 cited

An initialization method for the k-means using the concept of useful nearest centers

Hassan Ismkhan

The aim of the k-means is to minimize squared sum of Euclidean distance from the mean (SSEDM) of each cluster. The k-means can effectively optimize this function, but it is too sen…

cs.NE2015

Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem

Hassan Ismkhan, Kamran Zamanifar

The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crosso…

cs.NE2014

Using Ants as a Genetic Crossover Operator in GLS to Solve STSP

Hassan Ismkhan

Ant Colony Algorithm (ACA) and Genetic Local Search (GLS) are two optimization algorithms that have been successfully applied to the Traveling Salesman Problem (TSP). In this paper…

cs.NE2014

Accelerating the ANT Colony Optimization By Smart ANTs, Using Genetic Operator

Hassan Ismkhan

This paper research review Ant colony optimization (ACO) and Genetic Algorithm (GA), both are two powerful meta-heuristics. This paper explains some major defects of these two algo…

cs.NE2012★ 9 cited

Developing Improved Greedy Crossover to Solve Symmetric Traveling Salesman Problem

Hassan Ismkhan, Kamran Zamanifar

The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is re…