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.
In this work, we consider distributed adaptive learning over multitask mean-square-error (MSE) networks where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according ...
A novel formulation of beamforming is proposed for acquisition of the signals in reverberant acoustic clutter of interferences and noise. We derive the beamforming methods which incorporate the sparsity structure pertained to the acoustic source distributi ...
As large-scale theft of data from corporate servers is becoming increasingly common, it becomes interesting to examine alternatives to the paradigm of centralizing sensitive data into large databases. Instead, one could use cryptography and distributed com ...
We discuss the design of sampled-data economic nonlinear model predictive control schemes for continuous-time systems. We present novel sufficient convergence conditions that do not require any kind of terminal constraints nor terminal penalties. Instead, ...
Nematic elastomers and glasses are solids that display spontaneous distortion under external stimuli. Recent advances in the synthesis of sheets with controlled heterogeneities have enabled their actuation into nontrivial shapes with unprecedented energy d ...
We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. Moreover, we discuss extensions to non-unif ...
Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks can ...
Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft con ...
We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates con ...
This paper considers linear discrete-time systems with additive bounded disturbances subject to hard control input bounds and constraints on the expected number of state-constraint violations averaged over time, or, equivalently, constraints on the probabi ...
