Sommaire

  • Cet exposé a été présenté le 29 avril 2022.

Description

  • Orateur

    Christina Boura (UVSQ, CNRS, LMV)

Modelizing a problem using linear constraints and solving it by some Mixed Integer Linear Programming (MILP) solver is a popular approach in many domains of computer science. In this talk we present and compare different new techniques to modelize any subset of {0,1}^n for MILP. We then discuss the efficiency of our models by applying them to the search of differential paths, a classical problem in symmetric cryptography.

Infos pratiques

Prochains exposés

  • Users Pay Twice: The Hidden Energy Cost of Web Advertising

    • 04 décembre 2026 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Room Petri/Turing

    Orateur : Samuel Pélissier - CentraleSupélec

    Advertisements are everywhere on the Web: search engines promote results, most websites display ads, some require users to accept ads as a condition for access, video streaming services fund their infrastructure through an increasing volume of ads, and much of the gaming industry has adopted ad-based revenue models. In exchange for free access to a wide range of content, web users sacrifice their[…]
    • Privacy

Voir les exposés passés