Publication

Ordered Sets in the Calculus of Data Structures

Related publications (46)

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.

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

Designing Coalition-Proof Reverse Auctions Over Continuous Goods

Maryam Kamgarpour, Orcun Karaca

This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot inf ...

2019

Learning Generalized Nash Equilibria in a Class of Convex Games

Maryam Kamgarpour

We consider multiagent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel dis ...

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

A Dichotomy for Real Weighted Holant Problems

Sangxia Huang

Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as the counting constraint satisfaction problem (#CSP) and graph homomorphism. An effective dichotomy for such frameworks can ...

Springer Basel Ag2016

Modelling Resource Dependencies

Simon Bliudze, Alena Simalatsar, Alina Zolotukhina

The major research in the resource management literature focuses primarily on two directions: 1) specification languages for formulating resource requests and 2) constraint problems modelling allocation and scheduling. Both directions assume the knowledge ...

2016

Programming complex shapes in thin nematic elastomer and glass sheets

Marius Christopher Lemm

Nematic elastomers and glasses are solids that display spontaneous distortion under external stimuli. Recent advances in the synthesis of sheets with controlled heterogeneities have enabled their actuation into nontrivial shapes with unprecedented energy d ...

2016

On the Design of Economic NMPC Based on an Exact Turnpike Property

Dominique Bonvin, Timm Faulwasser

We discuss the design of sampled-data economic nonlinear model predictive control schemes for continuous-time systems. We present novel sufficient convergence conditions that do not require any kind of terminal constraints nor terminal penalties. Instead, ...

IFAC2015

Verifying and Synthesizing Software with Recursive Functions (Invited Contribution)

Viktor Kuncak

Our goal is to help people construct software that does what they wish. We develop tools and algorithms that span static and dynamic verification, constraint solving, and program synthesis. I will outline the current state our verification and synthesis sy ...

Springer-Verlag Berlin2014