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

Concept

Valeur de vérité

Publications associées (12)

Formula Normalizations in Verification

Viktor Kuncak, Simon Guilloud, Dragana Milovancevic, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2023

The irreducibility of vision: Gestalt, crowding and the fundamentals of vision

Michael Herzog

What is fundamental in vision has been discussed for millennia. For philosophical realists and the physiological approach to vision, the objects of the outer world are truly given, and failures to perceive objects properly, such as in illusions, are just s ...

2022

Towards a pragmatist dealing with algorithmic bias in medical machine learning

Georg Michael Joachim Starke

Machine Learning (ML) is on the rise in medicine, promising improved diagnostic, therapeutic and prognostic clinical tools. While these technological innovations are bound to transform health care, they also bring new ethical concerns to the forefront. One ...

2021

Switchover phenomenon induced by epidemic seeding on geometric networks

Gergely Odor

It is a fundamental question in disease modeling how the initial seeding of an epidemic, spreading over a network, determines its final outcome. One important goal has been to find the seed configuration, which infects the most individuals. Although the id ...

2021

Aerosol formation and growth rates from chamber experiments using Kalman smoothing

Lubna Dada

Bayesian state estimation in the form of Kalman smoothing was applied to differential mobility analyser train (DMA-train) measurements of aerosol size distribution dynamics. Four experiments were analysed in order to estimate the aerosol size distribution, ...

Copernicus Publications2021

Extending Boolean Methods for Scalable Logic Synthesis

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Eleonora Testa, Luca Gaetano Amarù

In recent years, Boolean methods in logic synthesis have been drawing the attention of EDA researchers due to the continuous push to advance quality of results. Boolean methods require high computational cost, as they rely on complete functional properties ...

2020

Fighting Rumours on Social Media

Chi Thang Duong

With the advance of social platforms, people are sharing contents in an unprecedented scale. This makes social platforms an ideal place for spreading rumors. As rumors may have negative impacts on the real world, many rumor detection techniques have been p ...

2018

Improvements to Boolean resynthesis

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù

In electronic design automation Boolean resynthesis techniques are increasingly used to improve the quality of results where algebraic methods hit local minima Boolean methods rely on complete functional properties of a logic circuit, preferably including ...

IEEE2018

SAT-Based Combinational and Sequential Dependency Computation

Giovanni De Micheli, Mathias Soeken

We present an algorithm for computing both functional dependency and unateness of combinational and sequential Boolean func- tions represented as logic networks. The algorithm uses SAT-based tech- niques from Combinational Equivalence Checking (CEC) ...

Springer2016

Distributed Constraint Optimization : Privacy Guarantees and Stochastic Uncertainty

Thomas Léauté

Distributed Constraint Satisfaction (DisCSP) and Distributed Constraint Optimization (DCOP) are formal frameworks that can be used to model a variety of problems in which multiple decision-makers cooperate towards a common goal: from computing an equilibri ...

EPFL2011

M-DPOP: Faithful distributed implementation of efficient social choice problems

Boi Faltings, Adrian Petcu

In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agents, where each agent has private information about its utility function. In th ...

2008

Alexandre Sarrasin (1895-1976) et l'esthétique de l'ingénieur

Philippe Mivelaz

Alexandre Sarrasin (1895-1976) studied at Zürich Federal Swiss Institute of Technology (ETH) from 1913 to 1918. Despite First World War's conflicts surrounding the neutral Switzerland, the intellectual climate inside ETH was cosmopolitan and liberal. As un ...

EPFL2007