Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

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.

Relying on the power flexibility of distributed energy resources (DERs) located in an active distribution network (ADN), this ADN will be able to provide power flexibility to the upper-layer grid at their point of common coupling (PCC). The power flexibili ...

This paper presents new optimization approaches aiming at reducing the impact of memory accesses on the performance of dataflow programs. The approach is based on introducing a high level management of composite data types in dynamic dataflow programming l ...

A method for certifying exact input trackability for constrained discrete time linear systems is introduced in this paper. A signal is assumed to be drawn from a reference set and the system must track this signal with a linear combination of its inputs. U ...

This thesis is devoted to the design and analysis of algorithms for scheduling problems. These problems are ubiquitous in the modern world. Examples include the optimization of local transportation, managing access to concurrent resources like runways at a ...

Introducing a preliminary Consists Selection in the Locomotive Assignment Problem

Chat with Graph Search

Coordinating Distributed Energy Resources and Utility-Scale Battery Energy Storage System for Power Flexibility Provision Under Uncertainty

Composite Data Types in Dynamic Dataflow Languages as Copyless Memory Sharing Mechanism

Guaranteeing Input Tracking For Constrained Systems: Theory and Application to Demand Response

Approximation Algorithms for Modern Multi-Processor Scheduling Problems