Concept
Deterministic algorithm
Related publications (35)
Dynamical Low Rank approximation of PDEs with random parameters
In this work, we focus on the Dynamical Low Rank (DLR) approximation of PDEs equations with random parameters. This can be interpreted as a reduced basis method, where the approximate solution is expanded in separable form over a set of few deterministic b ...
EPFL2017Symplectic Dynamical Low Rank approximation of wave equations with random parameters
Fabio Nobile, Eleonora Musharbash
In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of dynamica ...
2017MATHICSE Technical Report : Symplectic dynamical low rank approximation of wave equations with random parameters
Fabio Nobile, Eleonora Musharbash, Eva Vidlicková
In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of 2S dynamical ...
MATHICSE2017Efficient Algorithms for the Data Exchange Problem
Michael Christoph Gastpar, Sameer Pawar
In this paper, we study the data exchange problem, where a set of users is interested in gaining access to a common file, but where each has only partial knowledge about it as side-information. Assuming that the file is broken into packets, the side-inform ...
Institute of Electrical and Electronics Engineers2016Randomized versus Deterministic Implementations of Concurrent Data Structures
One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...
EPFL2012Deterministic algorithm for the cooperative data exchange problem
Michael Christoph Gastpar, Sameer Pawar
Download Citation Email Print Request Permissions Save to Project In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is f ...
IEEE2011Competitive ratio of List Scheduling on uniform machines and randomized heuristics
Antoine Musitelli, Jean-Marc Nicoletti
We study online scheduling on m uniform machines, where m - 1 of them have a reference speed 1 and the last one a speed s with 0
Springer US2011