Genitrini, Antoine Pépin, Martin Peschanski, Frederic

We study concurrent programs with non-deterministic choice, loops and a fork-join style of coordination under the lens of combinatorics. As a starting point, we interpret these programs as combinatorial structures. We propose a framework, based on analytic combinatorics, allowing to analyse their quantitative aspects such as the average number of e...

Coudert, David Nusser, André Viennot, Laurent

Hyperbolicity is a graph parameter which indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, ...

Laclé, Francis

Starting with a separate 2-adic reformulation of the Collatz function that maps parity orbits, we show that the stopping time $k$ of this reformulation can be alternatively derived with the help of some novel ideas as well as hybrid-algorithmic techniques.

Randriantsoa, Ando Ny Aina Fakra, Ali Hamada Ranjaranimaro, Manitra Pierrot Rachadi, Mohamed Nasroudine Mohamed Gatina, Jean Claude

The energy needs considerably increase with the economic development of a country. The promotion of renewable energy sources was enhanced because of global awareness of fossil fuel depletion and climate changes induced by their use. The renewable energy sources are, however, intermittent in nature. Alternative solutions such as the integration of r...

Adamou, Ibrahim Mourrain, Bernard

In this paper we consider the Voronoï diagram of a finite family of parallel half-lines, with the same orientation, constrained to a compact domain D0⊂R3, with respect to the Euclidean distance. We present an efficient approximation algorithm for computing such VD, using a subdivision process, which produces a mesh representing the topology of the ...

lemaitre, florian Hennequin, Arthur Lacassagne, Lionel

International audience

Durand, Martin pascual, fanny

We consider the multi organization scheduling problem (MOSP) [20]: given N organizations owning, each of them, one set of tasks and machines, the aim is to compute a schedule which gathers all the tasks on all the machines, and such that the makespan is minimized. A rationality constraint must be fulfilled: no organization should increases its make...

Ducoffe, Guillaume Dragan, Feodor

We present new algorithmic results for the class of Helly graphs, i.e., for the discrete analogues of hyperconvex metric spaces. Specifically, an undirected unweighted graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. It is known that every graph isometrically embeds into a Helly graph, that makes of ...

Pasquier, Nicolas Chatterjee, Sujoy

Customer Choice Modeling aims to model the decision-making process of customers, or segments of customers, through their choices and preferences identified by the analysis of their behaviors in one or more specific contexts. Clustering techniques are used in this context to identify patterns in their choices and preferences, to define segments of c...

Schoeters, Jason

In this thesis, we are interested in research questions that pertain respectively to temporal graphs, to mobility, as well as to the interaction between the two. The problem we consider on temporal graphs is motivated by a 20-year old open question, namely what the analog definition of a spanning tree in temporal graphs is. Our main result in this ...