Capturing trade-offs between daily scheduling choices
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The Zachman Framework offers a classification of the models created in an enterprise architecture project. These models form a holistic representation of the organization. Despite the prominent position of the Framework, there is little information publicl ...
This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...
A novel sequential approach is proposed for the multiperiod synthesis of Heat Exchanger Networks (HEN) and Utility Systems of chemical processes and energy systems. The framework can be used also for single period problems. Given the set of hot and cold pr ...
In this work a physical modelling framework is presented, describing the intelligent, non-local, and anisotropic behaviour of pedestrians. Its phenomenological basics and constitutive elements are detailed, and a qualitative analysis is provided. Within th ...
Nematodynamics is the orientation dynamics of flowless liquid-crystals. We show how Euler-Poincar, reduction produces a unifying framework for various theories, including Ericksen-Leslie, Luhiller-Rey, and Eringen's micropolar theory. In particular, we sho ...
We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, a ...
daptive networks (AN) have been recently proposed to address distributed estimation problems [1]–[4]. Here we extend prior work to changing topologies and data-normalized algorithms. The resulting framework may also treat signals with general distributions ...
Increasingly, uncertainties are explicitly considered for important engineering tasks. Often, little case-specific information is available for characterizing these uncertainties. Uniform distributions are an easy way to describe errors in absence of more ...
Robust dynamic optimization problems involving adaptive decisions are computationally intractable in general. Tractable upper bounding approximations can be obtained by requiring the adaptive decisions to be representable as linear decision rules (LDRs). I ...
We describe a set of probability distributions, dubbed compressible priors, whose independent and identically distributed (iid) realizations result in p-compressible signals. A signal x in R^N is called p-compressible with magnitude R if its sorted coeffic ...
