Publications related to Distributed Policy Evaluation Under Multiple Behavior Strategies

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Mario Paolone, Paolo Romano, Marco Pignati

The simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...

IEEE2015

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Ali H. Sayed

In Part I of this paper, also in this issue, we introduced a fairly general model for asynchronous events over adaptive networks including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. We perfor ...

Institute of Electrical and Electronics Engineers2015

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Cheng Wang

Given a system with

n > 3t + 1

processes, where

t

is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in

O(t)

expected running time. This improves the

O(n^2)

expected running ...

2015

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Performance analysis of multitask diffusion adaptation over asynchronous networks

Ali H. Sayed, Roula Nassif

The multitask diffusion LMS algorithm is an efficient strategy to address distributed estimation problems that are multitask-oriented in the sense that the optimum parameter vector may not be the same for every cluster of nodes. In this work, we explore th ...

IEEE2014

Dictionary learning over large distributed models via dual-ADMM strategies

Ali H. Sayed

We consider the problem of dictionary learning over large scale models, where the model parameters are distributed over a multi-agent network. We demonstrate that the dual optimization problem for inference is better conditioned than the primal problem and ...

IEEE2014

Adaptive Networks

Ali H. Sayed

This paper surveys recent advances related to adaptation, learning, and optimization over networks. Various distributed strategies are discussed that enable a collection of networked agents to interact locally in response to streaming data and to continual ...

IEEE2014

FID-guided retrospective motion correction based on autofocusing

Rolf Gruetter, Tobias Kober, Cristina Granziera, Gunnar Krüger

This work investigates the possibility of using FID navigator signals to improve the performance of a recently proposed autofocusing-based retrospective motion correction technique. FID navigators were incorporated into an MP-RAGE sequence and 3 subjects w ...

2014

Light Transport Matrix recovery for nearly planar objects

Martin Vetterli, Paolo Prandoni, Loïc Arnaud Baboulaz, Niranjan Thanikachalam

The light transport matrix has become a powerful tool for scene relighting, owing to the versatility of its representational power of various light transport phenomenon. We argue that scenes with an almost planar surface geometry, even with significant amo ...

SPIE2014

Distributed Policy Evaluation Under Multiple Behavior Strategies

Graph Chatbot

Chat with Graph Search

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Tight Bounds for Asynchronous Renaming

Performance analysis of multitask diffusion adaptation over asynchronous networks

Dictionary learning over large distributed models via dual-ADMM strategies

Adaptive Networks

FID-guided retrospective motion correction based on autofocusing

Light Transport Matrix recovery for nearly planar objects

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Adaptive Networks

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Performance analysis of multitask diffusion adaptation over asynchronous networks

Tight Bounds for Asynchronous Renaming

Light Transport Matrix recovery for nearly planar objects

FID-guided retrospective motion correction based on autofocusing

Dictionary learning over large distributed models via dual-ADMM strategies

Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity