Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Function problem

Publications associées (20)

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Learning from survey propagation: a neural network for MAX-E-3-SAT

Raffaele Marino

Many natural optimization problems are NP-hard, which implies that they are probably hard to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for all (or even most) instances in practice. This paper presents a new algo ...

IOP PUBLISHING LTD2021

Boolean satisfiability in quantum compilation

Giovanni De Micheli, Mathias Soeken, Heinz Riener, Bruno Schmitt Antunes, Giulia Meuli, Fereshte Mozafari Ghoraba

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program a ...

ROYAL SOC2020

Satisfiability-Based Methods for Digital Circuit Design, Debug, and Optimization

Andrew James Becker

Designing digital circuits well is notoriously difficult. This difficulty stems in part from the very many degrees of freedom inherent in circuit design, typically coupled with the need to satisfy various constraints. In this thesis, we demonstrate how for ...

EPFL2018

Canonical Computation without Canonical Representation

Mathias Soeken, Luca Gaetano Amarù, Ana Petkovska

A representation of a Boolean function is canonical if, given a variable order, only one instance of the representation is possible for the function. A computation is canonical if the result depends only on the Boolean function and a variable order, and do ...

IEEE2018

Influence of defect distribution on the reducibility of CeO2-x nanoparticles

Maria Chiara Spadaro

Ceria nanoparticles (NPs) are fundamental in heterogeneous catalysis because of their ability to store or release oxygen depending on the ambient conditions. Their oxygen storage capacity is strictly related to the exposed planes, crystallinity, density an ...

Iop Publishing Ltd2016

Bloch theorem with revised boundary conditions applied to glide and screw symmetric, quasi-one-dimensional structures

Florian Paul Robert Maurin

Bloch theorem is useful for analyzing wave propagation in periodic systems. It has been widely used to determine the energy bands of various translationally-periodic crystals and with the advent of nanoscale structures like nanotubes, it has been extended ...

Elsevier2016

A Sound and Complete Axiomatization of Majority-n Logic

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional logic systems. Also, the B ...

Institute of Electrical and Electronics Engineers2016

Fast generation of lexicographic satisfiable assignments: enabling canonicity in SAT-based applications

Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Ana Petkovska

Lexicographic Boolean satisfiability (LEXSAT) is a variation of the Boolean satisfiability problem (SAT). Given a variable order, LEXSAT finds a satisfying assignment whose integer value under the given variable order is minimum (maximum) among all satisfi ...

Assoc Computing Machinery2016

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014

A simulation-based optimization framework for urban transportation problems

Michel Bierlaire, Carolina Osorio Pizano

This paper proposes a simulation-based optimization (SO) method that enables the efficient use of complex stochastic urban traffic simulators to address various transportation problems. It presents a metamodel that integrates information from a simulator w ...

Informs2013

Stabilized reduced basis approximation of incompressible three-dimensional Navier–Stokes equations in parametrized deformed domains

Simone Deparis

In this work we are interested in the numerical solution of the steady incompressible Navier-Stokes equations for fluid flow in pipes with varying curvatures and cross-sections. We intend to compute a reduced basis approximation of the solution, employing ...

Springer Verlag2012

A stabilized finite volume element formulation for sedimentation-consolidation processes

Ricardo Esteban Ruiz Baier

A model of sedimentation-consolidation processes in so-called clarifier-thickener units is given by a parabolic equation describing the evolution of the local solids concentration coupled with a version of the Stokes system for an incompressible fluid desc ...

Siam Publications2012

Lagrange-Poincare field equations

Tudor Ratiu, François Gay-Balmaz

The Lagrange-Poincare equations of classical mechanics are cast into a field theoretic context together with their associated constrained variational principle. An integrability/reconstruction condition is established that relates solutions of the original ...

2011

An Improved LP-based Approximation for Steiner Tree

Thomas Rothvoss, Laura Sanità

The Steiner tree problem is one of the most fundamental

\mathbf{NP}

-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. In a sequence of papers, the approximation ratio for thi ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2010

Quantitative Languages

Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to d ...

2010

Neighboring-Extremal Control for Singular Dynamic Optimization Problems. II- Multiple-Input Systems

Dominique Bonvin, Benoît Chachuat, Sébastien Gros

Dynamic optimization provides a unified framework for improving process operations while taking operational constraints into account. In the presence of uncertainty, measurements can be incorporated into the optimization framework for tracking the optimum. ...

2009

Improved Related-Key Attacks on DESX and DESX+

In this paper, we present improved related-key attacks on the original DESX, and DESX+, a variant of the DESX with its pre- and post-whitening XOR operations replaced with addition modulo

2^{64}

. Compared to previous results, our attack on DESX has reduc ...

2008

Generalized vertex coloring problems using split graphs

Tinaz Ekim

Graph theory experienced a remarkable increase of interest among the scientific community during the last decades. The vertex coloring problem (Min Coloring) deserves a particular attention rince it has been able to capture a wide variety of applications. ...

EPFL2006

Existence, uniqueness and regularity of solutions for a thermomechanical model of shape memory alloys

Aïda Timofte

This thesis is devoted to the study of a thermomechanical model describing the macroscopic behavior of shape memory alloys. The analyzed model takes into account the non-isothermal character of the phase transition, as well as the existence of the intrinsi ...

EPFL2004