Toll Based Measures for Dynamical Graphs

A rough analysis sug- gests first to estimate the level sets of the probability density f (Polonik [16], Tsybakov [18], Cadre [3]), and then to evaluate the number of

We first introduce the notion of λ-K¨ onig relational graph model (Definition 6.5), and show that a relational graph model D is extensional and λ-K¨ onig exactly when the

Considering that the method of indirect rate of growth and the linear econometric methods provided the value for one type of meat that was closest to the real value,

Keywords: problem of network planning and management, lists of predecessors, graph of the project, minimizing of the required number of fictitious works..

In this paper, we extend the study of the square-free flow to the more gen- eral context of B -free integers, that is to say integers with no factor in a given family B of

We give a proof of convergence that does not use the concept of partial inverse and show how to choose a scaling factor to accelerate the convergence in the strongly monotone

We presented it under 3 formulations: a 2 parallel machine scheduling problem which objective is to minimize the makespan, a matrix visualization problem which the objective is

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des