Dataset - CKAN

List Ranking on PC Clusters

We present two algorithms for the List Ranking Problem in the Coarse Grained Multicomputer model (CGM for short): if $p$ is the number of processors and $n$ the size...

HTML

Feasability, Portability, Predictability and Efficiency : Four Ambitious Goal...

We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays...

HTML

List Ranking on a Coarse Grained Multiprocessor

We present a deterministic algorithm for the List Ranking Problem on a Coarse Grained p-Multiprocessor (CGM) that is only a factor of log*(p) away from optimality....

HTML

Two-dimensional Block Partitionings for the Parallel Sparse Cholesky Factoriz...

This paper presents a discussion on 2D block mappings for the sparse Cholesky factorization on parallel MIMD architectures with distributed memory. It introduces the...

HTML

Conditional Concurrent Rewriting

For implementing conditional concurrent rewriting on distributed memory machines / we have designed a transformation of conditional term rewriting systems to...

HTML

Parallelism in Hermite and Smith normal forms

Projet ARCHI

HTML

Epigraphical Projection and Proximal Tools for Solving Constrained Convex Opt...

We propose a proximal approach to deal with convex optimization problems involving nonlinear constraints. A large family of such constraints, proven to be effective in...

HTML

The CUDA implementation of the method of lines for the curvature dependent flows

http://dml.cz/handle/10338.dmlcz/141571

HTML

Using genetic algorithms for robot motion planning

We present an ongoing research work on robot motion planning using genetic algorithms. Our goal is to use this technique to build fast motion planners for robot with...

HTML

A Parallel Inertial Proximal Optimization Method

International audience

HTML

Dual constrained TV-based regularization on graphs

26 pages

HTML

An evolutionary algorithm for the vehicle routing problem with route balancing

International audience

HTML

Calculs pour les matrices denses : coût de communication et stabilité numérique

This dissertation focuses on a widely used linear algebra kernel to solve linear systems, that is the LU decomposition. Usually, to perform such a computation one uses...

HTML

Development of decoupled numerical scheme in solving dynamical systems on par...

In this thesis, we are interested in parallelization algorithm for solving dynamical systems. Many industrial applications nowadays lead to large systems of huge...