Concept

Problème du sac à dos

Publications associées (775)

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

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

A Robust Optimization Framework for the Day-Ahead Scheduling of Active Distribution Networks including Energy Storage Systems

Mario Paolone, Mokhtar Bozorg, Mostafa Nick

In this paper we present an adaptive robust optimization framework for the day-ahead scheduling of Active Distribution Networks (ADNs) where the controlled devices are distributed Energy Storage Systems (ESSs). First, the targeted problem is formulated usi ...

IEEE2019

Fast assembly of Galerkin matrices for 3D solid laminated composites using finite element and isogeometric discretizations

Pablo Antolin Sanchez

This work presents a novel methodology for speeding up the assembly of stiffness matrices for laminate composite 3D structures in the context of isogeometric and finite element discretizations. By splitting the involved terms into their in-plane and out-of ...

2019

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

On the Impact of Uncertainty for Path Planning

We consider the problem of planning paths on graphs with some edges whose traversability is uncertain; for each uncertain edge, we are given a probability of being traversable (e.g., by a learned classifier). We categorize different interpretations of the ...

2019

Deep Learning for Music: Similarity Search and Beyond

Matthieu Gaston Michel Albert Devaux

This paper is a study on the use of Machine Learning and Deep Learning to determine the similarity between different musics. The first part introduces the framework used and some concepts of Deep Learning that will be used in the algorithms. The second par ...

2019

The (h, k)-Server Problem on Bounded Depth Trees

Marek Elias

We study the k-server problem in the resource augmentation setting, i.e., when the performance of the online algorithm with k servers is compared to the offline optimal solution with h

ASSOC COMPUTING MACHINERY2019

On the complexity of linearizability

Jad Hamza

It was previously shown that the problem of verifying whether a finite concurrent system is linearizable can be done with an EXPSPACE complexity. However, the best known lower bound is PSPACE-hardness, and can be obtained using a reduction from control-sta ...

SPRINGER WIEN2019

Maximum-likelihood estimation of kinetic parameters via the extent-based incremental approach

Dominique Bonvin, Julien Léo Billeter, Diogo Filipe Mateus Rodrigues

For lumped homogeneous reaction systems, this paper presents a kinetic model identification scheme that provides maximum-likelihood parameter estimates and guarantees convergence to global optimality. The use of the extent-based incremental approach allows ...

PERGAMON-ELSEVIER SCIENCE LTD2019