Publications de Gael Lederrey | EPFL Graph Search

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully explored for the esti ...

This paper presents an overtaking decision algorithm for networked intelligent vehicles. The algorithm is based on a cooperative tracking and sensor fusion algorithm that we previously developed. The ego vehicle is equipped with lane keeping and lane chang ...

Data-driven and model-driven methodologies can be regarded as competitive fields since they tackle similar problems such as prediction. However, these two fields can learn from each other to improve themselves. Indeed, data-driven methodologies have been d ...

A macroscopic loading model for multi-directional, time-varying and congested pedestrian flows is proposed. Walkable space is represented by a network of streams that are each associated with an area in which they interact. To describe this interaction, a ...

Gael Lederrey

Chattez avec Graph Search

Estimation of discrete choice models with hybrid stochastic adaptive batch size algorithms

An Overtaking Decision Algorithm for Networked Intelligent Vehicles Based on Cooperative Perception

Bridging the gap between model-driven and data-driven methods in the era of Big Data

A dynamic network loading model for anisotropic and congested pedestrian flows