In recent years, graphics processing units (GPUs) have emerged as a powerful architecture for solving a broad spectrum of applications in very short periods of time. However, most existing GPU optimization approaches do not exploit the full power available in a CPU–GPU platform. They have a tendency to leave one of them partially unused (usually the CPU) and fail to establish an accurate exchange of information that could help solve the target problem efficiently. Thus, better performance is expected from devising a hybrid CPU–GPU parallel algorithm that combines the highly parallel stream processing power of GPUs with the higher power of multi-core architectures. We have developed a hybrid methodology to efficiently solve optimization prob...
The GPU is an effective architecture for sorting due to its massive parallelism and high memory band...
Neural networks stand out from artificial intelligence because they can complete challenging tasks, ...
The simplex algorithm has been successfully used for many years in solving linear programming (LP) p...
Hybrid metaheuristics are powerful methods for solving com- plex problems in science and industry. N...
International audienceIn this paper, we suggest a different methodology to shorten the code optimiza...
International audienceOver the last years, interest in hybrid metaheuristics has risen considerably ...
Future high-performance computing systems will be hybrid; they will include processors optimized for...
Simulation-optimization (Sim-Opt) is a widely used optimization technique that enables the use of si...
Graphics processor units (GPUs) are many-core processors that perform better than central processing...
Most of the problems of discrete optimization belong to the class of NP-complete problems. This mean...
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions ...
There are many combinatorial optimization problems such as flow shop scheduling, quadraticassignment...
Modern PCs are parallel and heterogeneous, with a growing number of cores for task parallelism and e...
Graphic processors are becoming faster and faster. Computational power within graphic processing uni...
International audienceIn this paper, we revisit the design and implementation of Branch-and-Bound (B...
The GPU is an effective architecture for sorting due to its massive parallelism and high memory band...
Neural networks stand out from artificial intelligence because they can complete challenging tasks, ...
The simplex algorithm has been successfully used for many years in solving linear programming (LP) p...
Hybrid metaheuristics are powerful methods for solving com- plex problems in science and industry. N...
International audienceIn this paper, we suggest a different methodology to shorten the code optimiza...
International audienceOver the last years, interest in hybrid metaheuristics has risen considerably ...
Future high-performance computing systems will be hybrid; they will include processors optimized for...
Simulation-optimization (Sim-Opt) is a widely used optimization technique that enables the use of si...
Graphics processor units (GPUs) are many-core processors that perform better than central processing...
Most of the problems of discrete optimization belong to the class of NP-complete problems. This mean...
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions ...
There are many combinatorial optimization problems such as flow shop scheduling, quadraticassignment...
Modern PCs are parallel and heterogeneous, with a growing number of cores for task parallelism and e...
Graphic processors are becoming faster and faster. Computational power within graphic processing uni...
International audienceIn this paper, we revisit the design and implementation of Branch-and-Bound (B...
The GPU is an effective architecture for sorting due to its massive parallelism and high memory band...
Neural networks stand out from artificial intelligence because they can complete challenging tasks, ...
The simplex algorithm has been successfully used for many years in solving linear programming (LP) p...