Distributed modifier-adaptation schemes for the real-time optimisation of uncertain interconnected systems
Publications associées (48)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Motivating workers to provide significant effort has been recognized as an important issue in crowdsourcing. It is important not only to compensate worker effort, but also to discourage low-quality workers from participating. Several proper incentive schem ...
We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting ...
In a multistage secret sharing (MSSS) scheme, the authorised subsets of participants could recover a number of secrets in different stages. A one-stage multisecret sharing (OSMSS) scheme is a special case of MSSS schemes in which all the secrets are recove ...
Vaccination is one of the most effective ways to protect people from being infected by infectious disease. However, it is often impractical to vaccinate all people in a community due to various resource constraints. Therefore, targeted vaccination, which v ...
We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user ...
Recently, different real-time optimization (RTO) schemes that guarantee feasibility of all RTO iterates and monotonic convergence to the optimal plant operating point have been proposed. However, simulations reveal that these schemes converge very slowly t ...
Public-key distance bounding schemes are needed to defeat relay attacks in payment systems. So far, only five such schemes exist, but fail to fully protect against malicious provers. In this paper, we solve this problem. We provide a full formalism to defi ...
2015
,
In this work we consider the cognitive many-to-one interference network. We first extend existing coding schemes from the two-user case to this network scenario. Then we present a novel coding scheme using compute-and-forward and show it can enlarge the ac ...
IEEE2013
,
This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...
2013
What is the relationship between the complexity and the fitness of evolved organisms, whether natural or artificial? It has been asserted, primarily based on empirical data, that the complexity of plants and animals increases as their fitness within a part ...