![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Jean-Charles Créput
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
- [b1]Jean-Charles Créput:
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). University of Burgundy, Dijon, France, 2008
Journal Articles
- 2023
- [j21]Beibei Cui, Jean-Charles Créput, Lei Zhang:
Self-organizing maps and full GPU parallel approach to graph matching. Comput. Commun. 198: 217-227 (2023) - 2022
- [j20]Abdelkhalek Mansouri, Jean-Charles Créput, Wenbao Qiao
:
Generic parallel data structures and algorithms to GPU superpixel image segmentation. Displays 74: 102275 (2022) - 2021
- [j19]Wenbao Qiao
, Jean-Charles Créput:
Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem. Appl. Soft Comput. 100: 106928 (2021) - 2020
- [j18]Wenbao Qiao
, Jean-Charles Créput:
Multiple k -opt evaluation multiple k -opt moves with GPU high performance local search to large-scale traveling salesman problems. Ann. Math. Artif. Intell. 88(4): 347-365 (2020) - [j17]Beibei Cui
, Jean-Charles Créput:
NCC Based Correspondence Problem for First- and Second-Order Graph Matching. Sensors 20(18): 5117 (2020) - [j16]Beibei Cui
, Jean-Charles Créput:
A Systematic Algorithm for Moving Object Detection with Application in Real-Time Surveillance. SN Comput. Sci. 1(2): 106 (2020) - 2019
- [j15]Wenbao Qiao
, Jean-Charles Créput:
GPU implementation of Borůvka's algorithm to Euclidean minimum spanning tree based on Elias method. Appl. Soft Comput. 76: 105-120 (2019) - 2017
- [j14]Hongjian Wang
, Abdelkhalek Mansouri, Jean-Charles Créput:
Cellular matrix model for parallel combinatorial optimization algorithms in Euclidean plane. Appl. Soft Comput. 61: 642-660 (2017) - [j13]Hongjian Wang
, Naiyu Zhang, Jean-Charles Créput:
A massively parallel neural network approach to large-scale Euclidean traveling salesman problems. Neurocomputing 240: 137-151 (2017) - 2016
- [j12]Hongjian Wang
, Naiyu Zhang, Jean-Charles Créput, Yassine Ruichek
, Julien Moreau
:
Massively parallel GPU computing for fast stereo correspondence algorithms. J. Syst. Archit. 65: 46-58 (2016) - 2015
- [j11]Hongjian Wang
, Naiyu Zhang, Jean-Charles Créput, Julien Moreau
, Yassine Ruichek
:
Parallel Structured Mesh Generation with Disparity Maps by GPU Implementation. IEEE Trans. Vis. Comput. Graph. 21(9): 1045-1057 (2015) - 2014
- [j10]Fabrice Lauri, Abderrafiaa Koukam, Jean-Charles Créput:
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) - 2013
- [j9]Rachid Dafali, Jean-Philippe Diguet, Jean-Charles Créput:
Self-Adaptive Network-on-Chip Interface. IEEE Embed. Syst. Lett. 5(4): 73-76 (2013) - 2012
- [j8]Jean-Charles Créput, Amir Hajjam, Abderrafiaa Koukam
, Olivier Kuhn:
Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. J. Comb. Optim. 24(4): 437-458 (2012) - 2010
- [j7]David Meignan
, Abderrafiaa Koukam
, Jean-Charles Créput:
Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism. J. Heuristics 16(6): 859-879 (2010) - [j6]David Meignan, Jean-Charles Créput, Abder Koukam
:
Un framework organisationnel et multi-agent pour la conception de métaheuristiques. Rev. d'Intelligence Artif. 24(6): 787-816 (2010) - 2009
- [j5]Jaroslaw Kozlak, Jean-Charles Créput, Vincent Hilaire, Abder Koukam:
Multi-Agent Environment for Modelling and Solving Dynamic Transport Problems. Comput. Informatics 28(3): 277-298 (2009) - [j4]Jean-Charles Créput, Abder Koukam
:
A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72(4-6): 1250-1264 (2009) - 2008
- [j3]Jean-Charles Créput, Abderrafiaa Koukam
:
The memetic self-organizing map approach to the vehicle routing problem. Soft Comput. 12(11): 1125-1141 (2008) - 2006
- [j2]Jaroslaw Kozlak, Jean-Charles Créput, Vincent Hilaire, Abder Koukam:
Multi-agent Approach to Dynamic Pick-up and Delivery Problem with Uncertain Knowledge about Future Transport Demands. Fundam. Informaticae 71(1): 27-36 (2006) - 2005
- [j1]Jean-Charles Créput, Abderrafiaa Koukam
, Thomas Lissajoux, Alexandre Caminada:
Automatic mesh generation for mobile network dimensioning using evolutionary approach. IEEE Trans. Evol. Comput. 9(1): 18-30 (2005)
Conference and Workshop Papers
- 2019
- [c21]Beibei Cui
, Jean-Charles Créput:
Using Entropy and Marr Wavelets to Automatic Feature Detection for Image Matching. SITIS 2019: 491-498 - 2018
- [c20]Beibei Cui
, Jean-Charles Créput:
Matlab GUI Application for Moving Object Detection and Tracking. DCAI (Special Sessions) 2018: 353-356 - [c19]Beibei Cui
, Jean-Charles Créput:
Moving Object Detection and Tracking Based on Three-Frame Difference and Background Subtraction with Laplace Filter. ICAISC (2) 2018: 3-13 - [c18]Wenbao Qiao
, Jean-Charles Créput:
Spiral Search Method to GPU Parallel Euclidean Minimum Spanning Tree Problem. LION 2018: 16-30 - [c17]Wenbao Qiao
, Jean-Charles Créput:
Massive 2-opt and 3-opt Moves with High Performance GPU Local Search to Large-Scale Traveling Salesman Problem. LION 2018: 82-97 - 2017
- [c16]Wenbao Qiao
, Jean-Charles Créput:
Massive Parallel Self-organizing Map and 2-Opt on GPU to Large Scale TSP. IWANN (1) 2017: 471-482 - 2016
- [c15]Wenbao Qiao
, Jean-Charles Créput:
Stereo Matching by Using Self-distributed Segmentation and Massively Parallel GPU Computing. ICAISC (2) 2016: 723-733 - [c14]Hongjian Wang, Abdelkhalek Mansouri, Jean-Charles Créput, Yassine Ruichek
:
Distributed Local Search for Elastic Image Matching. ICSIBO 2016: 65-74 - 2015
- [c13]Hongjian Wang, Abdelkhalek Mansouri, Jean-Charles Créput:
Massively parallel cellular matrix model for self-organizing map applications. ICECS 2015: 584-587 - [c12]Hongjian Wang, Abdelkhalek Mansouri, Jean-Charles Créput, Yassine Ruichek
:
Massively Parallel Cellular Matrix Model for Superpixel Adaptive Segmentation Map. MICAI (2) 2015: 325-336 - 2014
- [c11]Hongjian Wang, Jean-Charles Créput:
Parallel and Distributed Implementation Models for Bio-inspired Optimization Algorithms. ICSIBO 2014: 68-79 - [c10]Fabrice Lauri, Jean-Charles Créput, Abderrafiaa Koukam:
The Multi-agent Patrolling Problem Theoretical Results about Cyclic Strategies. PAAMS 2014: 171-182 - 2013
- [c9]Naiyu Zhang, Hongjian Wang, Jean-Charles Créput, Julien Moreau
, Yassine Ruichek
:
Cellular GPU Model for Structured Mesh Generation and Its Application to the Stereo-Matching Disparity Map. ISM 2013: 53-60 - [c8]Hongjian Wang, Naiyu Zhang, Jean-Charles Créput:
A Massive Parallel Cellular GPU Implementation of Neural Network to Large Scale Euclidean TSP. MICAI (2) 2013: 118-129 - 2009
- [c7]David Meignan
, Jean-Charles Créput, Abderrafiaa Koukam
:
A cooperative and self-adaptive metaheuristic for the facility location problem. GECCO 2009: 317-324 - 2008
- [c6]David Meignan
, Jean-Charles Créput, Abderrafiaa Koukam
:
A Coalition-Based Metaheuristic for the vehicle routing problem. IEEE Congress on Evolutionary Computation 2008: 1176-1182 - [c5]David Meignan, Jean-Charles Créput, Abder Koukam:
Un framework organisationnel pour la conception et l'implantation multi-agent de métaheuristiques (présentation courte). JFSMA 2008: 201-210 - 2007
- [c4]Jean-Charles Créput, Abderrafiaa Koukam
:
Self-organization and Evolution Combined to Address the Vehicle Routing Problem. Artificial Evolution 2007: 100-111 - 2004
- [c3]Jaroslaw Kozlak, Jean-Charles Créput, Vincent Hilaire, Abder Koukam:
Multi-agent Environment for Dynamic Transport Planning and Scheduling. International Conference on Computational Science 2004: 638-645 - [c2]Jean-Charles Créput, Abder Koukam, Jaroslaw Kozlak, Jan Lukasik:
An Evolutionary Approach to Pickup and Delivery Problem with Time Windows. International Conference on Computational Science 2004: 1102-1108 - 2002
- [c1]Thomas Lissajoux, Jean-Charles Créput, Abder Koukam, Denis Renaud:
Evolutionary Methods for the Antenna Parameter Setting Problem. IPDPS 2002
Parts in Books or Collections
- 2013
- [p2]Amir Hajjam, Jean-Charles Créput, Abderrafiaa Koukam:
From the TSP to the Dynamic VRP: An Application of Neural Networks in Population Based Metaheuristic. Metaheuristics for Dynamic Optimization 2013: 309-339 - 2008
- [p1]Jean-Charles Créput, Abderrafiaa Koukam
:
Self-organization in Evolution for the Solving of Distributed Terrestrial Transportation Problems. Soft Computing Applications in Industry 2008: 189-205
Coauthor Index
aka: Abderrafiaa Koukam
![](https://dblp.org/img/cog.dark.24x24.png)
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:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint