MATHICSE Technical Report : A continuation multilevel Monte Carlo algorithm
Graph Chatbot
Chat with Graph Search
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 modelling of prey-predator interactions is of major importance for the understanding of population dynamics. Classically, these interactions are modelled using ordinary differential equations, but this has the drawbacks of assuming continuous populatio ...
We carry out a comprehensive feasibility study for a real-time cm-level localisation of a predefined terrestrial target from a MAV-based autonomous platform. Specifically, we conduct an error propagation analysis which quantifies all potential error source ...
A fundamental requirement of quantitative palaeoecology is consistent taxonomy between a modern training set and palaeoecological data. In this study we assess the possible consequences of violation of this requirement by simulating taxonomic errors in tes ...
An anisotropic a posteriori error estimate is derived for a finite element discretization of the wave equation in two space dimensions. Only the error due to space discretization is considered, and the error estimates are derived in the nonnatural L-2(0, T ...
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the harmonic Maxwell's equations. The truth approximation and the development of th ...
We introduce Markov Decision Evolutionary Games with N players, in which each individual in a large population interacts with other randomly selected players. The states and actions of each player in an interaction together determine the instantaneous payo ...
In this study, the authors consider the class of anti-uniform Huffman (AUH) codes. The authors derived tight lower and upper bounds on the average codeword length, entropy and redundancy of finite and infinite AUH codes in terms of the alphabet size of the ...
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location problem (UFL), which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye and Zhang. Note, that the approximability lower bound by Guha and ...
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossiping, or epidemic algorithms. Similarly, in a network where mobile nodes occasio ...
Sensor localization from only connectivity information is a highly challenging problem. To this end, our result for the first time establishes an analytic bound on the performance of the popular MDS-MAP algorithm based on multidimensional scaling. For a ne ...
