ENAC

∙ Toulouse , France ∙ 0 followers

ENAC Alumni is a nonprofit organization, alumni association launched in 1987, and registered in Toulouse, Midi-Pyrénées.

Variations on Memetic Algorithms for Graph Coloring Problems

Graph vertex coloring with a given number of colors is a well-known and ...
01/08/2014 ∙ by Laurent Moalic, et al. ∙ 0 ∙ share

read it
Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

The only rigorous approaches for achieving a numerical proof of optimali...
10/16/2015 ∙ by Charlie Vanaret, et al. ∙ 0 ∙ share

read it
Airport Gate Scheduling for Passengers, Aircraft, and Operation

Passengers' experience is becoming a key metric to evaluate the air tran...
01/16/2013 ∙ by Sang Hyun Kim, et al. ∙ 0 ∙ share

read it
Predictive Interval Models for Non-parametric Regression

Having a regression model, we are interested in finding two-sided interv...
02/24/2014 ∙ by Mohammad Ghasemi Hamed, et al. ∙ 0 ∙ share

read it
Semi Parametric Estimations of rotating and scaling parameters for aeronautic loads

In this paper, we perform registration of noisy curves. We provide an ap...
09/24/2018 ∙ by Edouard Fournier, et al. ∙ 0 ∙ share

read it
Prediction of Preliminary Maximum Wing Bending Moments under Discrete Gust

Many methodologies have been proposed to quickly identify among a very l...
11/13/2018 ∙ by Edouard Fournier, et al. ∙ 0 ∙ share

read it
Optimality Clue for Graph Coloring Problem

In this paper, we present a new approach which qualifies or not a soluti...
12/17/2018 ∙ by Alexandre Gondran, et al. ∙ 0 ∙ share

read it
A conditional Berry-Esseen inequality

As an extension of a central limit theorem established by Svante Janson,...
01/28/2019 ∙ by Thierry Klein, et al. ∙ 0 ∙ share

read it
The coupling effect of Lipschitz regularization in deep neural networks

We investigate robustness of deep feed-forward neural networks when inpu...
04/12/2019 ∙ by Nicolas Couellan, et al. ∙ 0 ∙ share

read it
Lower Bound for (Sum) Coloring Problem

The Minimum Sum Coloring Problem is a variant of the Graph Vertex Colori...
09/19/2019 ∙ by Alexandre Gondran, et al. ∙ 0 ∙ share

read it
Fisher-Rao geometry of Dirichlet distributions

In this paper, we study the geometry induced by the Fisher-Rao metric on...
05/12/2020 ∙ by Alice Le Brigant, et al. ∙ 0 ∙ share

read it
A modification of quasi-Newton's methods helping to avoid saddle points

We recall that if A is an invertible and symmetric real m× m matrix, the...
06/02/2020 ∙ by Tuyen Trung Truong, et al. ∙ 0 ∙ share

read it
EAGP: An Energy-Aware Gossip Protocol for Wireless Sensor Networks

In Wireless Sensor Networks (WSN), typically composed of nodes with reso...
07/25/2020 ∙ by Bruno Chianca Ferreira, et al. ∙ 0 ∙ share

read it

ENAC

Featured Researchers

Thierry Klein

Nicolas Couellan

Stéphane Puechmorel

Alexandre Gondran

Nicolas Durand

Jean-Baptiste Gotteland

Daniel Delahaye

Mohammad Ghasemi Hamed

Vincent Duchamp

Tat Dat To

Bruno Chianca Ferreira

Variations on Memetic Algorithms for Graph Coloring Problems

Hybridization of Interval CP and Evolutionary Algorithms for Optimizing Difficult Problems

Airport Gate Scheduling for Passengers, Aircraft, and Operation

Predictive Interval Models for Non-parametric Regression

Semi Parametric Estimations of rotating and scaling parameters for aeronautic loads

Prediction of Preliminary Maximum Wing Bending Moments under Discrete Gust

Optimality Clue for Graph Coloring Problem

A conditional Berry-Esseen inequality

The coupling effect of Lipschitz regularization in deep neural networks

Lower Bound for (Sum) Coloring Problem

Fisher-Rao geometry of Dirichlet distributions

A modification of quasi-Newton's methods helping to avoid saddle points

EAGP: An Energy-Aware Gossip Protocol for Wireless Sensor Networks