Concept

Résolution de problème

Publications associées (581)

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Experiments in digital publishing: creating a digital compendium

Matteo Romanello

This chapter introduces the readers and users to the goals of the digitally provided index of the compendium Structures of Epic Poetry and the methods used for it. It also expands on the broader applicability of digital methods in view of electronic publis ...

De Gruyter2019

Simulation of the hydroabrasive erosion of a bucket: A multiscale model with projective integration to circumvent the spatio-temporal scale separation

François Avellan, Ebrahim Jahanbakhsh, Audrey Paulette Solange Maertens, Sebastián Camilo Leguizamón Sarmiento, Siamak Alimirzazadeh

The hydroabrasive erosion of hydraulic machine components, especially Pelton buckets and needles, is a widespread problem that entails significant costs. The multiscale nature of the process renders its simulation very computationally demanding unless spec ...

IOP PUBLISHING LTD2019

An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints

Volkan Cevher, Ahmet Alacaoglu, Armin Eftekhari, Fabian Ricardo Latorre Gomez, Mehmet Fatih Sahin

We propose a practical inexact augmented Lagrangian method (iALM) for nonconvex problems with nonlinear constraints. We characterize the total computational complexity of our method subject to a verifiable geometric condition, which is closely related to t ...

2019

On flexible Green function methods for atomistic/continuum coupling

Max Ludwig Hodapp

Atomistic/continuum (A/C) coupling schemes have been developed during the past twenty years to overcome the vast computational cost of fully atomistic models, but have not yet reached full maturity to address many problems of practical interest. This work ...

EPFL2018

Low-rank tensor methods for large Markov chains and forward feature selection methods

Francisco Santos Paredes Quartin de Macedo

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

EPFL2018

How will we plan and build in 25 years and how will this process be regulated?

Julien Gamerro

Constraints and regulations related to new buildings are constantly evolving and all these changes, in our ways of thinking and producing, will have an impact on standards. For the policy field, contractual relationships, risk-allocation models and procedu ...

2018

Freight railway network design problem

Michel Bierlaire, Virginie Janine Camille Lurkin, Nikola Obrenovic

In freight railway networks, commodities are usually transported via hubs, which are called marshaling or shunting yards, depending on their capacity. Consequently, the number and locations of these yards effect the transport costs to a great extent. The ...

2018

Atlas Polipilo, Ouest Lausannois

Dieter Dietz, Julien Lafontaine Carboni, Aurélie Dupuis

This course focuses on techniques and methods for an open and systematic compilation of images. Forms of visual information are major manifestations of a culture and will be explored in respect to their symbolic, intellectual or emotional power. All these ...

2018

Range-based underwater target localization using an autonomous surface vehicle: Observability analysis

In the field of marine robotics, the problem of range based underwater target localization can be defined as that of localizing an unknown - fixed or moving - target from a surface vehicle called the tracker, using range information available about the tar ...

2018

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