Previous Page 16

Displaying 301 – 319 of 319

Showing per page

Sur les α -flots

W. Bienia, V. Letrouit (1997)

RAIRO - Operations Research - Recherche Opérationnelle

Symmetric flows and broadcasting in hypercubes

Jean-Claude Bermond, A. Bonnecaze, T. Kodate, Stéphane Pérennes, Patrick Solé (1999)

Annales de l'institut Fourier

In this paper, we propose a method which enables to construct almost optimal broadcast schemes on an n -dimensional hypercube in the circuit switched, Δ -port model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured...

Synchronized traffic plans and stability of optima

Marc Bernot, Alessio Figalli (2008)

ESAIM: Control, Optimisation and Calculus of Variations

The irrigation problem is the problem of finding an efficient way to transport a measure μ+ onto a measure μ-. By efficient, we mean that a structure that achieves the transport (which, following [Bernot, Caselles and Morel, Publ. Mat.49 (2005) 417–451], we call traffic plan) is better if it carries the mass in a grouped way rather than in a separate way. This is formalized by considering costs functionals that favorize this property. The aim of this paper is to introduce a dynamical cost functional...

Currently displaying 301 – 319 of 319

Previous Page 16