Concept

Analyse amortie

Publications associées (33)

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

2023

Beyond worst-case analysis, with or without predictions

Andreas Maggiori

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings.In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competitive ...

EPFL2023

Decision support for the design of integrated biorefineries

Julia Granacher

A shift from fossil-based energy and products to more sustainable alternatives is essential to reduce greenhouse gas emissions and associated climate change impacts. Biomass represents a promising alternative for providing fuels and carbon-based products w ...

EPFL2023

Running Speed Estimation Using Shoe-Worn Inertial Sensors: Direct Integration, Linear, and Personalized Model

Kamiar Aminian, Mathieu Pascal Falbriard, Abolfazl Soltani

The overground speed is a key component of running analysis. Today, most speed estimation wearable systems are based on GNSS technology. However, these devices can suffer from sparse communication with the satellites and have a high-power consumption. In t ...

2021

Fully dynamic bin packing revisited

Kim-Manuel Klein, Klaus Jansen

We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, to minimize both the number of bins used as well as the amount of repacking. ...

SPRINGER HEIDELBERG2020

Fully automated detection, segmentation, and analysis of in vivo RPE single cells

Christophe Moser, Timothé Laforest, Laura Emmanuelle Kowalczuk, Florentino Luciano Caetano Dos Santos

Objective To develop a fully automated method of retinal pigmented epithelium (RPE) cells detection, segmentation and analysis based on in vivo cellular resolution images obtained with the transscleral optical phase imaging method (TOPI). Methods Fourteen ...

NATURE PUBLISHING GROUP2020

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

WILEY2019

Aggregate route choice models

Evanthia Kazagli

Route choice analysis concerns the understanding, modeling and prediction of the itinerary of an individual who travels from one position to another. In this thesis we elaborate on aggregate route choice analysis. The objective is the development of a flex ...

EPFL2017

Joint Friction during Deployment of a Near-Full-Scale Tensegrity Footbridge

Ian Smith, Ann Christine Sychterz

Most deployable structures, such as operable roofs and masts, move over one degree of freedom. This paper describes a structure that involves loosely coupled movement over several degrees of freedom. Analysis models of these structures are typically inaccu ...

American Society of Civil Engineers2017

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Christoph Koch, Immanuel Trummer

Query plans offer diverse tradeoffs between conflicting cost metrics such as execution time, energy consumption, or execution fees in a multi-objective scenario. It is convenient for users to choose the desired cost tradeoff in an interactive process, dyna ...

2015

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