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 Monge problem (Monge 1781; Taton 1951), as reformulated by Kantorovich (2006a, 2006b) is that of the transportation at a minimum "cost" of a given mass distribution from an initial to a final position during a given time interval. It is an optimal tran ...
Conscious awareness of the self as continuous through time is attributed to the human ability to remember the past and to predict the future, a cogitation that has been called "mental time travel" (MTT). MTT allows one to re-experience one's own past by su ...
Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor net ...
In this paper we give a recursive fixpoint characterization of the winning regions in Rabin and Streett games. We use this characterization in two ways. First, we introduce direct Rabin and Streett ranking that are a sound and complete way to characterize ...
Most hydrological models are valid at most only in a few places and cannot be reasonably transferred to other places or to far distant time periods. Transfer in space is difficult because the models are conditioned on past observations at particular places ...
Batch control has traditionally addressed the problems related to the absence of a steady state and the finite batch duration. Recently, batch control has added the dimension that arises naturally from the possibility of applying run-to-run control, i.e. i ...
We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time inter ...
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...
Institute of Electrical and Electronics Engineers2008
Departure time choice modeling has been part of main stream travel behavior research for more than three decades. Congestion management schemes are based on the assumption that travelers optimize their departure time choice. Ever since Vickrey, in the late ...
We find that the probabilistic bound on delay in the article by Goyal et al. in 1997 is incorrect. The problem originates from: 1) the difference between stationary and Palm probabilities and 2) treating the arrival counting process over some random time i ...
