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.
The main objective of the thesis is the study and the determination of an optimal navigation strategy, for a sailboat in an America's Cup race, by methods of stochastic optimization. Such methods are appropriate because the sailing team expects the wind to ...
Based on the results from a field survey campaign, this article describes three new developments which have been integrated to provide a comprehensive basis for the evaluation of overheating risk in offices. Firstly, a set of logistic regression equations ...
This paper presents a first approach to dynamic frequency-based transit assignment. As such the model aims to close the gap between schedule-based and frequency-based models. Frequency-based approaches have some advantages compared to schedule-based models ...
We present the first experimental study of time-resolved fluorescence from laser-excited Cs(6P(1/2)) atoms isolated in a solid He-4 matrix. The results are compared to the predictions of the bubble model including the interaction of the atomic dipole with ...
The binary data are often used in the medical field or in social sciences to study an effect between two groups. It can be for example the effect of a treatment between a treated and a control group. The outcome will be the number of successes and the tota ...
In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...
We consider an agent that must choose repeatedly among several actions. Each action has a certain probability of giving the agent an energy reward, and costs may be associated with switching between actions. The agent does not know which action has the hig ...
We consider a two-type contact process on Z in which both types have equal finite range and supercritical infection rate. We show that a given type becomes extinct with probability 1 if and only if, in the initial configuration, it is confined to a finite ...
We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P⊆U. Transmissions occur over l ...
Abstract: Map matching algorithms are the conventional way to generate path observations from GPS data for route choice models. The deterministic matching may introduce extra biases to parameters of route choice models if the matching is wrong. In this pap ...
