Stable Routing And Unique-Max Coloring On Trees

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (27)

Page 2 sur 2

The morning commute in urban areas with heterogeneous trip lengths

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

This paper investigates the equilibrium properties of the morning commute problem at the network level with heterogeneous trip lengths. Congestion is modeled with a Macroscopic Fundamental Diagram relating the space-mean speed of a network to the vehicular ...

2018

Network-Compute Co-Design for Distributed In-Memory Computing

Alexandros Daglis

The booming popularity of online services is rapidly raising the demands for modern datacenters. In order to cope with data deluge, growing user bases, and tight quality of service constraints, service providers deploy massive datacenters with tens to hund ...

EPFL2018

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Patrick Thiran, Sébastien Christophe Henri

In recent years, multipath routing, i.e., employing several paths simultaneously, has emerged as an efficient way to provide significant throughput gains in local networks. This has been observed both with technologies that are not subject to interference, ...

IEEE2018

Optimal Number of Paths with Multipath Routing in Hybrid Networks

Patrick Thiran, Sébastien Christophe Henri

2018

Synthesis of single and interplant non-isothermal water networks

François Maréchal, Maziar Kermani

This paper addresses the synthesis problem of non-isothermal water networks using a mathematical programming approach. A heat-integrated water network superstructure and its corresponding mixed integer nonlinear programming (MINLP) model is proposed for th ...

2017

Optimization Opportunities in RRAM-based FPGA Architectures

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Xifan Tang

Static Random Access Memory (SRAM)-based routing multiplexers, whatever structure is employed, share a common limitation: their area, delay and power increase linearly with the input size. This property results in most SRAM-based FPGA architectures ...

IEEE2017

A tutorial on the use of graphs in discrete tomography

Dominique de Werra, Bernard Ries

Starting from the basic image reconstruction problem in discrete tomography some graph theoretical models are proposed. This suggests the study of some variations and extensions of the basic problem. Applications in scheduling and timetabling are described ...

Springer-Verlag2008