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 Informatik2022Machine-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 Publishing2020On 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 HEIDELBERG2020A general framework for the integration of complex choice models into mixed integer optimization
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 ...
EPFL2020On 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 AG2018On the lower semicontinuous envelope of functionals defined on polyhedral chains
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