Le résumé automatique de document a pour but de créer une version réduite d’un ensemble de textes pour aider des utilisateurs à mieux assimiler l’information...

Cette étude exploratoire est originale dans le champ de l'accompagnement. A partir de la base de données horodatées fournie par Google, notre étude retrace l...

GenoGraphiX-Log 2.0 (abbreviation GGXLog) is a keystroke logging software that was developed as a collaboration between <a href="" title="https://www.h...

Aggregator is an open-source python package which aims to facilitate the exploitation of relational datasets by automating feature aggregation.

This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...

In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...

In this paper, we establish the maximum number of basic shortest paths in Cartesian product graphs and bounds on the maximum number of the vertex-disjoint sh...

For the last decades, community detection is a well-studied problem because it has applications in various fields. Variable Neighborhood Search (VNS) is an e...

Distance measures play an important role in data analysis, mainly for clustering purpose, but also for data representation (for instance using multidimension...

Any telecommunication network is subject to a node or link failure at any given time. Such a failure may impact the quality of the services provided by the n...

Nous donnons des conditions nécessaires et suffisante pour l'existence d'un graphe simple, ou d'un graphe connexe simple, ayant des nombres donnés `(m_{ij}...

Les heuristiques basées sur la théorie des graphes sont largement utilisées dans plusieurs domaines pour résoudre approximativement des problèmes d'optimisat...

Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...

Trends in wireless networks are proceeding toward increasingly dense deployments, supporting resilient interconnection for applications that carry ever highe...

In this paper, we propose a new scheme for building algorithms to detect communities in networks. This new approach is based upon a vertex centrality measur...

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

Cet article présente les résultats de deux explorations, une exhaustive, des graphes de 4 à 10 sommets, et l'autre utilisant le programme AGX-III, des graphe...

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

In the literature, graphs are often studied in terms of invariants, for instance the number of vertices or edges, the stability number, the chromatic number ...

Écrire un texte de qualité est un processus complexe. Plusieurs domaines d'études se penchent sur les possibilités d'analyse des pratiques d'écriture des bon...