Concept

Constraint satisfaction problem

Related publications (352)

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.

Automated Design: A Journey Across Modelling, Optimization, and Education

Cyril Picard

Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...

EPFL2021

Algebraic and Boolean Optimization Methods for AQFP Superconducting Circuits

Giovanni De Micheli, Eleonora Testa, Heinz Riener, Siang-Yun Lee

Adiabatic quantum-flux-parametron (AQFP) circuits are a family of superconducting electronic (SCE) circuits that have recently gained growing interest due to their low-energy consumption, and may serve as alternative technology to overcome the down-scalin ...

Association for Computing Machinery2021

Stochastic Optimal Control for Autonomous Driving Applications via Polynomial Chaos Expansions

Colin Neil Jones, Petr Listov, Johannes Christian Schwarz

Model-based methods in autonomous driving and advanced driving assistance gain importance in research and development due to their potential to contribute to higher road safety. Parameters of vehicle models, however, are hard to identify precisely or they ...

2021

Online Contention Resolution Schemes With Applications To Bayesian Selection Problems

Ola Nils Anders Svensson, Moran Feldman, Rico Zenklusen

We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call o ...

2021

Heightening of Very High Gravity Dams: The Case Study of the Grande Dixence

Giovanni De Cesare, Pedro Filipe De Almeida Manso, Basile Clerc

Heightening very high gravity dams is one of the solutions considered as part of the energy transition and to mitigate the effects of climate change. The paper presents a stepwise approach to assess the potential for dam heightening and its impact on the h ...

Springer, Cham2021

Vessel scheduling with pilotage and tugging considerations

Michel Bierlaire

This paper considers vessel scheduling with pilotage and tugging constraints in berthing operations with channel restrictions at seaports. To our knowledge, pilotage and tugging requirements have not been simultaneously considered in the literature. This w ...

PERGAMON-ELSEVIER SCIENCE LTD2021

In-body Antennas Design Based on Fundamental Limits of Obtainable Power Density

Anja Skrivervik, Zvonimir Sipus

In-body medical implants are one of the most promising solutions for increasing patient healthcare in the future. Many such devices already exist, however, each new design is a challenge due to size constraints and communication issues which arise due to s ...

IEEE2021

A positive combinatorial formula for symplectic Kostka-Foulkes polynomials I: Rows

Thomas Gerber

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing cocyclage in terms of wh ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

On the asymptotic behavior of the solutions to parabolic variational inequalities

Maria Colombo

We consider various versions of the obstacle and thin-obstacle problems, we interpret them as variational inequalities, with non-smooth constraint, and prove that they satisfy a new constrained Lojasiewicz inequality. The difficulty lies in the fact that, ...

2020

Safe non-smooth black-box optimization with application to policy search

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

For safety-critical black-box optimization tasks, observations of the constraints and the objective are often noisy and available only for the feasible points. We propose an approach based on log barriers to find a local solution of a non-convex non-smooth ...

PMLR2020