Publication

A tractable analytical model for large-scale congested protein synthesis networks

Publications associées (44)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Where Did the News Come From? Detection of News Agency Releases in Historical Newspapers

Lea Marxen

Since their beginnings in the 1830s and 1840s, news agencies have played an important role in the national and international news market, aiming to deliver news as fast and as reliable as possible. While we know that newspapers have been using agency conte ...

2023

, ,

This work investigates the benefits of a two-layer adaptive signal control framework combining multi-region perimeter control (PC) with distributed Max Pressure (MP) control in selected network intersections. Motivated by MP’s questionable performance in o ...

2022

True scale-free networks hidden by finite size effects

Andrea Rinaldo, Samir Suweis, Amos Maritan

We analyze about 200 naturally occurring networks with distinct dynamical origins to formally test whether the commonly assumed hypothesis of an underlying scale-free structure is generally viable. This has recently been questioned on the basis of statisti ...

NATL ACAD SCIENCES2021

, ,

Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to automatic ...

2020

Coupled dynamical systems are omnipresent in everyday life. In general, interactions between individual elements composing the system are captured by complex networks. The latter greatly impact the way coupled systems are functioning and evolving in time. ...

EPFL2020

In complex network-coupled dynamical systems, two questions of central importance are how to identify the most vulnerable components and how to devise a network making the overall system more robust to external perturbations. To address these two questions ...

2019

Prism-based path set restriction for solving Markovian traffic assignment problem

Yuki Oyama

This paper deals with a main limitation of Markovian traffic assignment (MTA) models: when the network includes cyclic structures and the link costs are small enough, the fact that the MTA models assign traffic flows to all feasible paths causes computatio ...

Elsevier2019

The structure in cortical microcircuits deviates from what would be expected in a purely random network, which has been seen as evidence of clustering. To address this issue, we sought to reproduce the nonrandom features of cortical circuits by considering ...

Soc Neuroscience2017

Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity Networks

Eleni Stai

Computing the most central nodes in large-scale commodity networks is rather important for improving routing and associated applications. In this paper, we introduce a novel framework for the analysis and efficient computation of routing path-based central ...

Ieee Computer Soc2017