Concept

Constraint satisfaction

Publications associées (223)

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a standard multiplier m ...

2014

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

Colin Neil Jones, Jean-Hubert Hours

Ieee2014

Protecting Privacy through Distributed Computation in Multi-agent Decision Making

Boi Faltings, Thomas Léauté

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 ...

AI Access Foundation2013

CafeSat: a Modern SAT Solver for Scala

Régis William Blanc

We present CafeSat, a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state-of-the-art techniques and heuristics. It uses two-watched literals for Boolean constraint propagation, conflict-dr ...

ACM Press2013

On Cafesat: A Modern SAT Solver for Scala

Régis William Blanc

2013

New Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

Rüdiger Urbanke, Nicolas Macris, Seyed Hamed Hassani

This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in effici ...

2013

Plug and Play Distributed Model Predictive Control Based on Distributed Invariance and Optimization

Colin Neil Jones, Giancarlo Ferrari Trecate, Ye Pu, Melanie Nicole Zeilinger

Abstract—This paper presents a method for plug-and-play distributed MPC of a network of interacting linear systems. The previously introduced idea of plug and play control addresses the challenge of performing network changes in the form of subsystems that ...

2013

A Multipath Sparse Beamfroming Method

Hervé Bourlard, Volkan Cevher, Afsaneh Asaei

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 ...

2013

Interchangeability with thresholds and degradation factors for Soft CSPs

Boi Faltings, Nicoleta Neagu

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 ...

Springer2013

Patch-based methods for variational image processing problems

Emmanuel D'Angelo

Image Processing problems are notoriously difficult. To name a few of these difficulties, they are usually ill-posed, involve a huge number of unknowns (from one to several per pixel!), and images cannot be considered as the linear superposition of a few p ...

EPFL2013

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.

Connectez-vous pour utiliser Chat avec Graph Search