Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Page 2 sur 2

The role of PDE-based parameterization techniques in gradient-based IGA shape optimization applications

Jochen Peter Hinz

This paper proposes a shape optimization algorithm based on the principles of Isogeometric Analysis (IGA) in which the parameterization of the geometry enters the problem formulation as an additional PDE-constraint. Inspired by the isoparametric principle ...

2021

Geometric optimization of dielectric elastomer electrodes for dynamic applications

Herbert Shea, Bekir Aksoy

Dielectric elastomers are soft actuators, made of an elastomer membrane sandwiched by compliant electrodes. Because of their high energy density and quick response, they are well suited for dynamic applications such as loudspeakers. Thanks to progress in t ...

ELSEVIER SCI LTD2021

Systematic Method for the Energy-Saving Potential Calculation of Air Conditioning Systems via Data Mining. Part II: A Detailed Case Study

Shen Yang, Xianlin Wang

Increased data monitoring enables the energy-efficient operation of air-conditioning systems via data-mining. The latter is projected to have lesser consumption but more comprehensive diagnosis than traditional methods. Following the companion paper that p ...

2021

Optimization Methods for Control: From Embedded Programmable Hardware to Data-Driven Process Optimization

Harsh Ambarishkumar Shukla

The research community has been making significant progress in hardware implementation, numerical computing and algorithm development for optimization-based control. However, there are two key challenges that still have to be overcome for optimization-base ...

EPFL2021

Dynamic Byzantine Reliable Broadcast

Rachid Guerraoui, Jovan Komatovic, Dragos-Adrian Seredinschi

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik2021

Adaptation and Learning Over Networks Under Subspace Constraints-Part I: Stability Analysis

Ali H. Sayed, Stefan Vlaski, Roula Nassif

This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Estimation of discrete choice models with hybrid stochastic adaptive batch size algorithms

Michel Bierlaire, Virginie Janine Camille Lurkin, Timothy Michael Hillel, Gael Lederrey

The emergence of Big Data has enabled new research perspectives in the discrete choice community. While the techniques to estimate Machine Learning models on a massive amount of data are well established, these have not yet been fully explored for the esti ...

2021

A new wake model and comparison of eight algorithms for layout optimization of wind farms in complex terrain

Fernando Porté Agel

Layout optimization of wind farms constitutes an important and challenging task in complex terrain. This is especially due to the complex interactions of the boundary layer flows in complex terrain and wind turbine wakes, which renders wake modelling in co ...

ELSEVIER SCI LTD2020

Robust P2P Personalized Learning

Rachid Guerraoui

Decentralized machine learning over peer-to-peer networks is very appealing for it enables to learn personalized models without sharing users data, nor relying on any central server. Peers can improve upon their locally trained model across a network graph ...

IEEE2020

Forward-Backward Splitting for Optimal Transport Based Problems

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic, Guillermo Ortiz Jimenez, Effrosyni Simou

Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When the entropy regula ...

IEEE2020