Publication

Distributed Pareto Optimization via Diffusion Strategies

Related publications (65)

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.

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that gp is a fixed point free involution. If C is extremal of length a multiple of 24, all the involutions are fixed point free, except the Golay Code and ev ...

Institute of Electrical and Electronics Engineers2013

New Techniques For Obtaining Schubert-Type Formulas For Hamiltonian Manifolds

Silvia Sabatini

In [GT], Goldin and Tolman extend some ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. (See also [Kn99,Kn08].) The main goal of this paper is to build on this ...

Int Press Boston, Inc2013

Simple ways to pace trains

Daniel Emery

As long as a train does not conflict with others trains, the energy consumption for traction can be minimized according to its times of departure, arrival, and passing through fixed points. However, when a conflict of itineraries is foreseen, pacing trains ...

Ieee2013

A fixed point theorem for L1 spaces

Nicolas Monod

We prove a fixed point theorem for a family of Banach spaces, notably for L^1. Applications include the optimal answer to the "derivation problem" for group algebras which originated in the 1960s. ...

Springer-Verlag2012

Synthesis of uniform amplitude focused beam arrays

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...

2012

AN INTEGRATED FRAMEWORK FOR MULTI-CHANNEL MULTI-SOURCE LOCALIZATION AND VOICE ACTIVITY DETECTION

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh

Two of the major challenges in microphone array based adap- tive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gra- dient steered re ...

Idiap2011

An Integrated Framework for Multi-Channel Multi-Source Localization and Voice Activity Detection

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh

Two of the major challenges in microphone array based adaptive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gradient steered respon ...

2011

Multi-stage stochastic programming provides a versatile framework for optimal decision making under uncertainty, but it gives rise to hard functional optimization problems since the adaptive recourse decisions must be modeled as functions of some or all un ...

IEEE2011

Ground-state energy and spin gap of spin-1/2 Kagome-Heisenberg antiferromagnetic clusters: Large-scale exact diagonalization results

We present a comprehensive list of the ground-state energies and the spin gaps of finite Kagome clusters with up to 42 spins obtained using large-scale exact diagonalization techniques. This represents the current limit of this exact approach. For a fixed ...

2011

, ,

It is well known that spatial averaging can be realized (in space or frequency domain) using algorithms whose complexity does not scale with the size or shape of the filter. These fast algorithms are generally referred to as constant-time or O(1) algorithm ...

IEEE2011