( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism.

, , и . J. Heuristics, 16 (6): 859-879 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jean-Charles Boisson

Jean-Charles Profizi

Jean Charles Munch

Jean-Charles Tournier

Jean-Charles Huet

 

Другие публикации лиц с тем же именем

Hybridation de métaheuristiques pour la résolution distribuée de problèmes d'optimisation spatialisés. (Hybrid métaheuristics for distributed solving of euclidean optimization problems).. (2008)Multi-Agent Environment for Modelling and Solving Dynamic Transport Problems., , , и . Comput. Informatics, 28 (3): 277-298 (2009)Self-organizing maps and full GPU parallel approach to graph matching., , и . Comput. Commun., (2023)From the TSP to the Dynamic VRP: An Application of Neural Networks in Population Based Metaheuristic., , и . Metaheuristics for Dynamic Optimization, том 433 из Studies in Computational Intelligence, Springer, (2013)A cooperative and self-adaptive metaheuristic for the facility location problem., , и . GECCO, стр. 317-324. ACM, (2009)GPU implementation of Borůvka's algorithm to Euclidean minimum spanning tree based on Elias method., и . Appl. Soft Comput., (2019)Le problème de la patrouille multiagent. Étude de convergence de l'évaluation des stratégies cycliques., , и . Rev. d'Intelligence Artif., 28 (6): 665-687 (2014)A memetic neural network for the Euclidean traveling salesman problem., и . Neurocomputing, 72 (4-6): 1250-1264 (2009)Multi-agent Environment for Dynamic Transport Planning and Scheduling., , , и . International Conference on Computational Science, том 3038 из Lecture Notes in Computer Science, стр. 638-645. Springer, (2004)The memetic self-organizing map approach to the vehicle routing problem., и . Soft Comput., 12 (11): 1125-1141 (2008)