Axe 1 : Valorisation des données pour la prise de décision

Retour

Cahiers du GERAD

407 résultats — page 11 de 21

, et

In this paper, we introduce the notion of dynamic copulas to model serial dependence as well as interdependence between several time series. The proposed m...

référence BibTeX
et

La confection de calendriers sportifs dans le milieu scolaire québécois est une tâche complexe à laquelle la Fédération Québécoise du Sport Étudiant (FQSE) d...

référence BibTeX
, et

The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...

référence BibTeX
, et

A total dominating set in a digraph <i>G</i> is a subset <i>W</i> of its vertices such that every vertex of <i>G</i> has an immediate successor in <i>W</i>. ...

référence BibTeX
, et

A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...

référence BibTeX
et

In this article we find the optimal solution of the hedging problem in discrete time by minimizing the mean square hedging error, when the underlying assets ...

référence BibTeX
et

In this article, we construct a Malliavin derivative for functionals of a square-integrable Lévy process. The Malliavin derivative is defined via chaos expan...

référence BibTeX
, et

A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved ...

référence BibTeX
, , et

Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...

référence BibTeX
, , et

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...

référence BibTeX
, et

Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters su...

référence BibTeX
, et

Discrete-time survival data with time-varying covariates are often encountered in practice. One such example is bankruptcy studies where the status of each f...

référence BibTeX
, et

It is observed that mutations in the formulations of test problems over time are not infrequent. Ensuing problems are illustrated with examples from geometri...

référence BibTeX
, et

Finding maximum likelihood parameter values for Finite Mixture Model (FMM) is often done with the Expectation Maximization (EM) algorithm. However the choice...

référence BibTeX
, et

We consider an inventory routing problem in discrete time where a supplier has to serve a set of customers over a time horizon. A capacity constraint for th...

référence BibTeX
, , et

A profit and a demand are associated with each arc of a set of profitable arcs of a given graph. A travel time is associated with each arc of the graph. A fl...

référence BibTeX
, et

<p> The complementarity of two renewable energy sources, namely hydro and wind, is investigated. We consider the diversification effect of wind power to re...

référence BibTeX
, et

Tree based methods have not yet been adapted to handle mixed effects. Previous works extending them to accommodate correlated data are based on the multivari...

référence BibTeX
et

A magnet is a pair <i>u,v</i> of adjacent vertices such that the proper neighbours of <i>u</i> are completely linked to the proper neighbours of <i>v</i>. It...

référence BibTeX
, et

This work proposes a statistical methodology to handle aggregate data. Aggregate data arises in many fields such as medical science, ecology, social science,...

référence BibTeX