Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We analyze the class of networks characterized by modular structure where a sequence of l Erdos-Renyi random networks of size N >> 1 with random average degrees is joined by links whose structure must remain immaterial. We find that traceroutes spanning th ...
We analyze a short-term revenue optimization problem that involves the optimal targeting of customers for a promotion in which a finite number of perishable items are sold on a last-minute offer. The goal is to select the subset of customers to whom the of ...
The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This paper defines a vari ...
In the solution of fluid-structure interaction (FSI) problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers that interact in an iterative framework through the exchange of suitable transmission conditions ...
Society for Industrial and Applied Mathematics2010
The tracking of cell populations in time-lapse microscopy images enables high-throughput spatiotemporal measurements of cell dynamics. In this paper, we present a new algorithm to simultaneously track many cells in crowded areas. The algorithm runs in real ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
We present a new approximation algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines. We prove that for an arbitrary parameter k it yields solutions with at most (3/2 + 1/k)*OPT+9k many processors, thus it gives a ...
A theoretical stochastic approach is presented for the structural analysis of plunge pool liners dynamically loaded by the impact of free-falling jets. Such an approach was used as the real behaviour of plunge pool liners is complex, and deterministic meth ...
The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...
The tracking of cell populations in time-lapse microscopy images enables high-throughput spatiotemporal measurements of cell dynamics. In this paper, we present a new algorithm to simultaneously track many cells in crowded areas. The algorithm runs in rea ...
This paper considers disassembly scheduling, which is the problem of determining the quantity and timing of the end-of-use/life products to be disassembled while satisfying the demand for their parts obtained from disassembling the products over a planning ...
