default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichaël Krajecki
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c30]Maxim Moraru, Adrien Roussel
, Hugo Taboada, Christophe Jaillet, Marc Pérache, Michaël Krajecki:
Performance Improvements of Parallel Applications thanks to MPI-4.0 Hints. SBAC-PAD 2022: 273-282- [c29]Cassandra Rocha Barbosa, Pierre Lemarinier, Guillaume Papauré, Marc Pérache, Michaël Krajecki:
SABO: Dynamic MPI+OpenMP Resource Balancer. IPDRM@SC 2022: 1-8 - 2021
- [j12]Lucas Mohimont, Amine Chemchem, François Alin, Michaël Krajecki, Luiz Angelo Steffenel:
Convolutional neural networks and temporal CNNs for COVID-19 forecasting in France. Appl. Intell. 51(12): 8784-8809 (2021)
2010 – 2019
- 2019
- [j11]Amine Chemchem, François Alin, Michaël Krajecki:
Improving the Cognitive Agent Intelligence by Deep Knowledge Classification. Int. J. Comput. Intell. Appl. 18(1): 1950005:1-1950005:25 (2019) - [c28]Amine Chemchem, François Alin, Michaël Krajecki:
Combining SMOTE Sampling and Machine Learning for Forecasting Wheat Yields in France. AIKE 2019: 9-14 - [c27]François Alin, Amine Chemchem, Florent Nolot, Olivier Flauzac, Michaël Krajecki:
Towards a Hierarchical Deep Learning Approach for Intrusion Detection. MLN 2019: 15-27 - 2018
- [c26]Julien Loiseau, François Alin, Christophe Jaillet, Michaël Krajecki:
FleCSPHg: A GPU Accelerated Framework for Physics and Astrophysics Simulations. CARLA 2018: 123-137 - [c25]Amine Chemchem, François Alin, Michaël Krajecki:
Deep Learning and Data Mining Classification through the Intelligent Agent Reasoning. FiCloud Workshops 2018: 13-20 - 2017
- [j10]Gaëtan Rubez, Jean-Matthieu Etancelin, Xavier Vigouroux, Michaël Krajecki, Jean-Charles Boisson, Eric Henon:
GPU accelerated implementation of NCI calculations using promolecular density. J. Comput. Chem. 38(14): 1071-1083 (2017) - [c24]Arnaud Renard, Jean-Matthieu Etancelin, Michaël Krajecki:
romeoLAB: A High Performance Training Platform for HPC, GPU and DeepLearning. CARLA 2017: 55-67 - [c23]Habib Daneshpajouh, Pierre Delisle, Jean-Charles Boisson, Michaël Krajecki, Nordin Zakaria:
Parallel Batch Self-Organizing Map on Graphics Processing Unit Using CUDA. CARLA 2017: 87-100 - 2016
- [j9]Michaël Krajecki, Julien Loiseau, François Alin, Christophe Jaillet:
Many-Core Approaches to Combinatorial Problems: case of the Langford Problem. Supercomput. Front. Innov. 3(2): 21-37 (2016) - [c22]Michaël Krajecki, Julien Loiseau, François Alin, Christophe Jaillet:
BFS Traversal on Multi-GPU Cluster. CSE/EUC/DCABES 2016: 594-599 - 2015
- [j8]Romain Vasseur, Stéphanie Baud, Luiz Angelo Steffenel, Xavier Vigouroux, Laurent Martiny, Michaël Krajecki, Manuel Dauchez:
Inverse docking method for new proteins targets identification: A parallel approach. Parallel Comput. 42: 48-59 (2015) - 2014
- [i1]Florian Legendre, Gilles Dequen, Michaël Krajecki:
Logical Reasoning to Detect Weaknesses About SHA-1 and MD4/5. IACR Cryptol. ePrint Arch. 2014: 239 (2014) - 2013
- [j7]Audrey Delevacq, Pierre Delisle, Marc Gravel, Michaël Krajecki:
Parallel Ant Colony Optimization on Graphics Processing Units. J. Parallel Distributed Comput. 73(1): 52-61 (2013) - [c21]Romain Vasseur, Stéphanie Baud, Luiz Angelo Steffenel, Xavier Vigouroux, Laurent Martiny, Michaël Krajecki, Manuel Dauchez:
Parallel strategies for an inverse docking method. EuroMPI 2013: 253-258 - [c20]Florian Legendre, Gilles Dequen, Michaël Krajecki:
From a Logical Approach to Internal States of Hash Functions - How SAT Problem Can Help to Understand SHA-* and MD*. SECRYPT 2013: 435-443 - 2012
- [c19]Florian Legendre, Gilles Dequen, Michaël Krajecki:
Encoding Hash Functions as a SAT Problem. ICTAI 2012: 916-921 - [c18]Audrey Delevacq, Pierre Delisle, Michaël Krajecki:
Parallel GPU Implementation of Iterated Local Search for the Travelling Salesman Problem. LION 2012: 372-377 - [c17]Florian Legendre, Gilles Dequen, Michaël Krajecki:
Inverting Thanks to SAT Solving - An Application on Reduced-step MD*. SECRYPT 2012: 339-344 - 2011
- [c16]Gabriel Noaje, Christophe Jaillet, Michaël Krajecki:
Source-to-Source Code Translator: OpenMP C to CUDA. HPCC 2011: 512-519 - 2010
- [j6]Olivier Flauzac, Michaël Krajecki, Luiz Angelo Steffenel:
CONFIIT: a middleware for peer-to-peer computing. J. Supercomput. 53(1): 86-102 (2010) - [c15]Audrey Delevacq, Pierre Delisle, Marc Gravel, Michaël Krajecki:
Parallel Ant Colony Optimization on Graphics Processing Units. PDPTA 2010: 196-202
2000 – 2009
- 2009
- [j5]Pascal Vander-Swalmen, Gilles Dequen, Michaël Krajecki:
A Collaborative Approach for Multi-Threaded SAT Solving. Int. J. Parallel Program. 37(3): 324-342 (2009) - [c14]Gilles Dequen, Pascal Vander-Swalmen, Michaël Krajecki:
Toward Easy Parallel SAT Solving. ICTAI 2009: 425-432 - [c13]Pascal Vander-Swalmen, Michaël Krajecki, Gilles Dequen:
Automatic parallel SAT solving using MTSS. HPCS 2009: 176-177 - [c12]Pierre Delisle, Marc Gravel, Michaël Krajecki:
Multi-colony Parallel Ant Colony Optimization on SMP and Multi-core Computers. NaBIC 2009: 318-323 - 2008
- [j4]Michaël Krajecki, Christophe Jaillet, Alain Bui:
Parallel Tree Search for Combinatorial Problems: a Comparative Study between OpenMP and MPI, . Stud. Inform. Univ. 6(3): 274-312 (2008) - [c11]Pascal Vander-Swalmen, Gilles Dequen, Michaël Krajecki:
On Multi-threaded Satisfiability Solving with OpenMP. IWOMP 2008: 146-157 - 2007
- [c10]Christophe Jaillet, Michaël Krajecki:
A New Memory Allocation Model for Parallel Search Space Data Structures with OpenMP. IWOMP 2007: 148-152 - 2005
- [j3]Zineb Habbas, Michaël Krajecki, Daniel Singer:
Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study. Int. J. Comput. Sci. Eng. 1(2/3/4): 192-206 (2005) - [c9]Pierre Delisle, Marc Gravel, Michaël Krajecki, Caroline Gagné, Wilson L. Price:
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory. Hybrid Metaheuristics 2005: 1-11 - 2004
- [c8]Arnaud Renard, Michaël Krajecki, Alain Bui:
On-Request Urban Transport Parallel Optimization. IICS 2004: 266-275 - [c7]Michaël Krajecki, Olivier Flauzac, Pierre-Paul Mérel:
Focus on the Communication Scheme in the Middleware CONFIIT Using XML-RPC. IPDPS 2004 - [c6]Christophe Jaillet, Michaël Krajecki:
Solving the Langford Problem in Parallel. ISPDC/HeteroPar 2004: 83-90 - 2003
- [c5]Olivier Flauzac, Michaël Krajecki, Jean Fugère:
CONFIIT: A Middleware for Peer to Peer Computing. ICCSA (3) 2003: 69-78 - 2002
- [c4]Christophe Jaillet, Michaël Krajecki, Jean Fugère:
A Parallel Shared Memory Simulator for Command and Control. HPCS 2002: 237-242 - 2001
- [j2]Zineb Habbas, Francine Herrmann, Michaël Krajecki:
A Fast Parallel Tree Contraction for the Ray-object Calculus Using Open-MP. Comput. Artif. Intell. 20(1): 77-92 (2001) - [j1]Zineb Habbas, Michaël Krajecki, Daniel Singer:
Shared Memory Implementation of Constraint Satisfaction Problem Resolution. Parallel Process. Lett. 11(4): 487-501 (2001) - [c3]Zineb Habbas, Michaël Krajecki, Daniel Singer:
The Langford's Problem: A Challenge for Parallel Resolution of CSP. PPAM 2001: 789-796
1990 – 1999
- 1999
- [c2]Michaël Krajecki:
An Object Oriented Environment to Manage the Parallelism of the FIIT Applications. PaCT 1999: 229-234 - [c1]Zineb Habbas, Francine Herrmann, Daniel Singer, Michaël Krajecki:
A Methodological Approach to Implement CSP on FPGA. IEEE International Workshop on Rapid System Prototyping 1999: 66-
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-05-08 20:59 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:
