Publication

Can Dynamic Priority Be Pareto Improving?

Publications associées (33)

The Obukhov-Corrsin theory of scalar turbulence [21, 54] advances quantitative predictions on passive-scalar advection in a turbulent regime and can be regarded as the analogue for passive scalars of Kolmogorov's K41 theory of fully developed turbulence [4 ...

London2023

The electron self-interaction is a long-standing problem in density functional theory and is particularly critical in the description of polarons. Polarons are quasiparticles involving charge localization coupled with self-induced lattice distortions. Sinc ...

EPFL2023

Hubbard U through polaronic defect states

Alfredo Pasquarello, Stefano Falletta

Since the preliminary work of Anisimov and co-workers, the Hubbard corrected DFT+U functional has been used for predicting properties of correlated materials by applying on-site effective Coulomb interactions to specific orbitals. However, the determinatio ...

NATURE PORTFOLIO2022

Active learning for multi-objective optimization of processes and energy systems

François Maréchal, Julia Granacher

In superstructure optimization of processes and energy systems, the design space is defined as the combination of unit considerations, process conditions and model parameters that might be subjected to uncertainty. Most of the time, decision makers are not ...

Elsevier Science2022

Impacts of Metering-Based Dynamic Priority Schemes

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

Several works published over the last two decades have shown for a stylized set-up with homogeneous users that metering-based priority (MBP) schemes may generate Pareto improving departure time adjustments similar to those induced by congestion pricing, bu ...

INFORMS2021

Extending R2P2 with Congestion Control and Request-Level Scheduling

Konstantinos Prasopoulos

Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...

2020

The Gaussian lossy Gray-Wyner network

Michael Christoph Gastpar, Erixhen Sula

We consider the problem of source coding subject to a fidelity criterion for the Gray-Wyner network that connects a single source with two receivers via a common channel and two private channels. The pareto-optimal trade-offs between the sum-rate of the pr ...

2020

An optimization framework for exclusive bus lane allocation in large networks with dynamic congestion

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Road space distribution among multiple modes of transport in urban networks has attracted the interest of several researchers and policy planners. Traditionally, these problems are solved by ignoring operational and dynamic characteristics of multi-modal c ...

2019

Discrimination of numerical proportions: A comparison of binomial and Gaussian models

Aire Raidvee

Observers discriminated the numerical proportion of two sets of elements (N = 9, 13, 33, and 65) that differed either by color or orientation. According to the standard Thurstonian approach, the accuracy of proportion discrimination is determined by irredu ...

Springer2017

Evidence for eligibility traces in human learning

Michael Herzog, Wulfram Gerstner, Kerstin Preuschoff, Marco Philipp Lehmann, He Xu, Vasiliki Liakoni

Whether we prepare a coffee or navigate to a shop: in many tasks we make multiple decisions before reaching a goal. Learning such state-action sequences from sparse reward raises the problem of credit-assignment: which actions out of a long sequence should ...

arXiv2017

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