For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding loca...
Ekaterina Alekseeva, Yury Kochetov, Alexander Plya...
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
S. Mounir Alaoui, Ophir Frieder, Tarek A. El-Ghaza...
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...