Concept

Constraint satisfaction

Publications associées (223)

Influence of Subjective Impressions of a Space on Brightness Satisfaction: an Experimental Study in Virtual Reality

This paper investigates the relationship between participants’ satisfaction with brightnessand other key perceptual attributesof the sceneto gain insight in howuser satisfaction with brightnessis influencedby factorsother than brightness levels. In this st ...

2019

SAT Based Exact Synthesis using DAG Topology Families

Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk

SAT based exact synthesis is a powerful technique, with applications in logic optimization, technology mapping, and synthesis for emerging technologies. However, its runtime behavior can be unpredictable and slow. In this paper, we propose to add a new typ ...

IEEE2018

Impacts of Constraints and Constraint Handling Strategies for Multi-Objective Mechanical Design Problems

Jürg Alexander Schiffmann, Cyril Picard

Multi-objective optimization tools are becoming increasingly popu-lar in mechanical engineering and allow decision-makers to better understand the inevitable trade-offs. Mechanical design problems can however combine properties that make the use of optimiz ...

2018

Distributed Coupled Learning Over Adaptive Networks

Ali H. Sayed, Sulaiman A S A E Alghunaim

This work develops an effective distributed algorithm for the solution of stochastic optimization problems that involve partial coupling among both local constraints and local cost functions. While the collection of networked agents is interested in discov ...

IEEE2018

A Single-Phase, Proximal Path-Following Framework

Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis

We propose a new proximal path-following framework for a class of constrained convex problems. We consider settings where the nonlinear-and possibly nonsmooth-objective part is endowed with a proximity operator, and the constraint set is equipped with a se ...

INFORMS2018

A Framework for the Secretary Problem on the Intersection of Matroids

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen

The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one- ...

ASSOC COMPUTING MACHINERY2018

Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls

Daniel Kuhn, Grani Adiwena Hanasusanto

Adaptive robust optimization problems are usually solved approximately by restricting the adaptive decisions to simple parametric decision rules. However, the corresponding approximation error can be substantial. In this paper we show that two-stage robust ...

2018

One-step solution to local tie vector determination at co-located GNSS/VLBI sites

Jean-Philippe Lucien Montillet

The local tie vector, which connects the different space geodetic techniques at a co-located site, plays an important role in the realization of the International Terrestrial Reference Frame (ITRF). This paper presents a new method to determine the tie vec ...

SPRINGER2018

Stochastic Three-Composite Convex Minimization with a Linear Operator

Volkan Cevher

We develop a primal-dual convex minimization framework to solve a class of stochastic convex three-composite problem with a linear operator. We consider the cases where the problem is both convex and strongly convex and analyze the convergence of the propo ...

JMLR: W&CP2018

Robot Learning with Task-Parameterized Generative Models

Sylvain Calinon

Task-parameterized models provide a representation of movement/behavior that can adapt to a set of task parameters describing the current situation encountered by the robot, such as location of objects or landmarks in its workspace. This paper gives an ove ...

Springer2018

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