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.
This paper deals with a software package for the numerical analysis in transient and steady-state modes of power electrical networks or variable speed drives with arbitrary topologies. The package is composed of a series of units, each representing a speci ...
This paper presents an application of heuristic methods to the restoration of distribution networks after disturbances. The heuristic approach is proposed since the problem needs more reasoning than pure calculation. Due to the combinatorial aspect of the ...
The current definition of 3D digital lines, which uses the 2D digital lines of closest integer points (Bresenham's lines) of two projections, has several drawbacks: the discrete topology of this 3D digital line notion is not clear; its third projection is, ...
The thesis studies the optimization of a specific type of computer graphic representation: polygon-based, textured models. More precisely, we focus on meshes having 4-8 connectivity. We study a progressive and adaptive representation for textured 4-8 meshe ...
Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective ...
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approxima ...
Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive--increase and multiplicative--decrease. We show that the source rates tend to be distributed in order to maximize an objectiv ...
