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.
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
From several decades, non-adjacent form (NAF) representations for integers have been extensively studied as an alternative to the usual binary number system where digits are in {0,1}. In cryptography, the non-adjacent digit set (NADS) {-1,0,1} is used for ...
In this thesis we will treat the Dirichlet problem for systems of implicit equations, i.e. where Ω ⊂ Rn is an open set, u : Ω → Rm, Fi : Ω × Rm × Rm×n → R, m,n ≥ 1, are continuous functions and φ, the boundary datum, is given. At first we will be intereste ...
We give a lower bound for the number of vertices of a general d-dimensional polytope with a given number m of i-faces for each i=0,....,[d/2]-1. The tightness of those bounds is proved using McMullen's conditions. For m greater than a small constant, those ...
Urban land-use planning and management are in constant mutation throughout the world. With sustainability as the goal, the use of indicators for land auditing and monitoring is becoming more and more in demand. Classical approaches consider the set of indi ...
Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair allocation; in most, but not all cases, they are based on the notion ...
Convex parameterization of fixed-order robust stabilizing controllers for systems with polytopic uncertainty is represented as an LMI using KYP Lemma. This parameterization is a convex inner-approximation of the whole non-convex set of stabilizing controll ...
We present a new method for signal reconstruction from multiple sets of samples with unknown offsets. We rewrite the reconstruction problem as a set of polynomial equations in the unknown signal parameters and the offsets between the sets of samples. Then, ...
We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area. ...
