Concept

Application sous-linéaire

Publications associées (21)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Machine-Learning of Atomic-Scale Properties Based on Physical Principles

Michele Ceriotti, Michael John Willatt

We briefly summarize the kernel regression approach, as used recently in materials modelling, to fitting functions, particularly potential energy surfaces, and highlight how the linear algebra framework can be used to both predict and train from linear fun ...

Springer International Publishing2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

A general framework for the integration of complex choice models into mixed integer optimization

Meritxell Pacheco Paneque

The objective of this thesis is to develop a general methodology to incorporate a disaggregate demand representation in supply-oriented optimization problems that allows to capture the interplay between the behavior of individuals and the decisions to be o ...

EPFL2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

On the lower semicontinuous envelope of functionals defined on polyhedral chains

Maria Colombo

In this note we prove an explicit formula for the lower semicontinuous envelope of some functionals defined on real polyhedral chains. More precisely, denoting by H:R→[0,∞) an even, subadditive, and lower semicontinuous function with H(0)=0, and by ΦH the ...

2017

Ambiguous Joint Chance Constraints under Mean and Dispersion Information

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We study joint chance constraints where the distribution of the uncertain parameters is only known to belong to an ambiguity set characterized by the mean and support of the uncertainties and by an upper bound on their dispersion. This setting gives rise t ...

Informs2017

Cocycle growth for the Steinberg representation

Thibaut Dumont

This thesis investigates the growth of the natural cocycle introduced by Klingler for the Steinberg representation. When possible, we extend the framework of simple algebraic groups over a local field to arbitrary Euclidean buildings. In rank one, the grow ...

EPFL2016

CO2 emissions in relation to street-network configuration and city size

Nahid Mohajeri Pour Rayeni

The street-network efficiency of tens of British cities in relation to transport fuel consumption and CO2 emissions are analyzed. The results show a strong linear positive correlation between length entropy and average street length, and a negative correla ...

Pergamon-Elsevier Science Ltd2015

Optimal Glass-Forming Solvent Brings Sublimation Dynamic Nuclear Polarization to 129Xe Hyperpolarization Biomedical Imaging Standards

Christophe Roussel, Andrea Capozzi, Jean-Noël Hyacinthe, Arnaud Comment

In addition to the dedicated spin exchange optical pumping (SEOP) technique, an alternative method to produce hyperpolarized xenon gas using dynamic nuclear polarization (DNP) followed by a sublimation procedure was proposed. The challenge associated with ...

American Chemical Society2015

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