Publication

Programming complex shapes in thin nematic elastomer and glass sheets

Publications associées (36)

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

High Permittivity Siloxanes as Promising Materials for Dielectric Elastomer Transducers: From Synthesis to Application

Yauhen Sheima

The speed of change in the modern world is impressive. Within the last 50 years, many devices and technologies have significantly transformed their appearance, intrinsic characteristics and improved their performance. Computers have changed from the size o ...

EPFL2022

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

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

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

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

Distributed learning over multitask networks with linearly related tasks

Ali H. Sayed, Roula Nassif

In this work, we consider distributed adaptive learning over multitask mean-square-error (MSE) networks where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according ...

IEEE2016

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