default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Gmys
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Maxime Gobert
, Guillaume Briffoteaux, Jan Gmys, Nouredine Melab, Daniel Tuyttens:
Observations in applying Bayesian versus evolutionary approaches and their hybrids in parallel time-constrained optimization. Eng. Appl. Artif. Intell. 137: 109075 (2024)- [c11]Guillaume Helbecque, Tiago Carneiro, Nouredine Melab, Jan Gmys, Pascal Bouvry:
PGAS Data Structure for Unbalanced Tree-Based Algorithms at Scale. ICCS (3) 2024: 103-111 - 2023
- [j13]Guillaume Helbecque, Jan Gmys, Nouredine Melab, Tiago Carneiro, Pascal Bouvry:
Parallel distributed productivity-aware tree-search using Chapel. Concurr. Comput. Pract. Exp. 35(27) (2023) - 2022
- [j12]Maxime Gobert, Jan Gmys, Jean-François Toubeau, Nouredine Melab, Daniel Tuyttens, François Vallée:
Batch Acquisition for Parallel Bayesian Optimization - Application to Hydro-Energy Storage Systems Scheduling. Algorithms 15(12): 446 (2022) - [j11]Jan Gmys:
Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers. INFORMS J. Comput. 34(5): 2502-2522 (2022) - [c10]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization. ICPP Workshops 2022: 21:1-21:8 - [c9]Maxime Gobert, Jan Gmys, Jean-François Toubeau, Nouredine Melab, Daniel Tuyttens, François Vallée:
Parallel Bayesian Optimization for Optimal Scheduling of Underground Pumped Hydro-Energy Storage Systems. IPDPS Workshops 2022: 790-797 - [c8]Guillaume Helbecque, Jan Gmys, Tiago Carneiro, Nouredine Melab, Pascal Bouvry:
A performance-oriented comparative study of the Chapel high-productivity language to conventional programming environments. PMAM@PPoPP 2022: 21-29 - [c7]Nikolaus Frohner, Jan Gmys, Nouredine Melab, Günther R. Raidl, El-Ghazali Talbi:
Parallel Beam Search for Combinatorial Optimization (Extended Abstract). SOCS 2022: 273-275 - 2021
- [c6]Johann Dréo, Arnaud Liefooghe, Sébastien Vérel, Marc Schoenauer, Juan Julián Merelo Guervós, Alexandre Quemy, Benjamin Bouvier, Jan Gmys:
Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics: 22 years of Paradiseo. GECCO Companion 2021: 1522-1530 - [i2]Johann Dréo, Arnaud Liefooghe, Sébastien Vérel, Marc Schoenauer, Juan Julián Merelo Guervós, Alexandre Quemy, Benjamin Bouvier, Jan Gmys:
Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics - 22 Years of Paradiseo -. CoRR abs/2105.00420 (2021) - 2020
- [j10]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem. Eur. J. Oper. Res. 284(3): 814-833 (2020) - [j9]Tiago Carneiro, Jan Gmys, Nouredine Melab, Daniel Tuyttens:
Towards ultra-scale Branch-and-Bound using a high-productivity language. Future Gener. Comput. Syst. 105: 196-209 (2020) - [j8]Nouredine Melab, Jan Gmys, Peter Korosec, Imen Chakroun:
Synergy between parallel computing, optimization and simulation. J. Comput. Sci. 44: 101168 (2020) - [j7]Guillaume Briffoteaux, Maxime Gobert, Romain Ragonnet, Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Parallel surrogate-assisted optimization: Batched Bayesian Neural Network-assisted GA versus q-EGO. Swarm Evol. Comput. 57: 100717 (2020) - [j6]Jan Gmys, Tiago Carneiro, Nouredine Melab, El-Ghazali Talbi, Daniel Tuyttens:
A comparative study of high-productivity high-performance programming languages for parallel metaheuristics. Swarm Evol. Comput. 57: 100720 (2020) - [p1]Nouredine Melab, Jan Gmys, Mohand Mezmaz, Daniel Tuyttens:
Many-Core Branch-and-Bound for GPU Accelerators and MIC Coprocessors. High-Performance Simulation-Based Optimization 2020: 275-291 - [i1]Jan Gmys:
Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers. CoRR abs/2012.09511 (2020)
2010 – 2019
- 2019
- [c5]Maxime Gobert, Jan Gmys, Jean-François Toubeau, François Vallée, Nouredine Melab, Daniel Tuyttens:
Surrogate-Assisted Optimization for Multi-stage Optimal Scheduling of Virtual Power Plants. HPCS 2019: 113-120 - 2018
- [j5]Tiago Carneiro Pessoa, Jan Gmys, Francisco Heron de Carvalho Junior, Nouredine Melab, Daniel Tuyttens:
GPU-accelerated backtracking using CUDA Dynamic Parallelism. Concurr. Comput. Pract. Exp. 30(9) (2018) - [j4]Nouredine Melab, Jan Gmys, Mohand-Said Mezmaz, Daniel Tuyttens:
Multi-core versus many-core computing for many-task Branch-and-Bound applied to big optimization problems. Future Gener. Comput. Syst. 82: 472-481 (2018) - [c4]Jan Gmys:
Optimal Solving of Permutation-based Optimization Problems on Heterogeneous CPU/GPU Clusters. HPCS 2018: 799-801 - [c3]Tiago Carneiro, Jan Gmys, Nouredine Melab, Francisco Heron de Carvalho Junior, Pedro Pedrosa Rebouças Filho, Daniel Tuyttens:
Dynamic Configuration of CUDA Runtime Variables for CDP-Based Divide-and-Conquer Algorithms. VECPAR 2018: 16-30 - 2017
- [b1]Jan Gmys:
Heterogeneous cluster computing for many-task exact optimization - Application to permutation problems. (Optimisation massivement multi-tâche sur grappes de calcul hétérogènes - Application aux problèmes de permutation). University of Mons, Belgium, 2017 - [j3]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
IVM-based parallel branch-and-bound using hierarchical work stealing on multi-GPU systems. Concurr. Comput. Pract. Exp. 29(9) (2017) - 2016
- [j2]Jan Gmys, Rudi Leroy, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
Work stealing with private integer-vector-matrix data structure for multi-core branch-and-bound algorithms. Concurr. Comput. Pract. Exp. 28(18): 4463-4484 (2016) - [j1]Jan Gmys, Mohand-Said Mezmaz, Nouredine Melab, Daniel Tuyttens:
A GPU-based Branch-and-Bound algorithm using Integer-Vector-Matrix data structure. Parallel Comput. 59: 119-139 (2016) - [c2]Tiago Carneiro Pessoa, Jan Gmys, Nouredine Melab, Francisco Heron de Carvalho Junior, Daniel Tuyttens:
A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems. ICA3PP 2016: 310-324 - 2015
- [c1]Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens:
IVM-Based Work Stealing for Parallel Branch-and-Bound on GPU. PPAM (1) 2015: 548-558
Coauthor Index
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-09-10 01:17 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:
