Inclusions différentielles et problèmes variationnels
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.
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 show that for critical reversible attractive Nearest Particle Systems all equilibrium measures are convex combinations of the upper invariant equilibrium measure and the point mass at all zeros, provided the underlying renewal sequence possesses moments ...
We investigate the behavior of isotropic invariant subspaces of skew-Hamiltonian matrices under structured perturbations. It is shown that finding a nearby subspace is equivalent to solving a certain quadratic matrix equation. This connection is used to de ...
Society for Industrial and Applied Mathematics2005
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 it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...
In this paper, the multi-agent containment problem is investigated. In particular, we focus our efforts on a continuation of our previous work on leader-follower networks, by imposing a hierarchical structure on the network topology. The main idea is to or ...
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 control ...
Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p ∈ P, the convex hull of Q∪{p} does not contain the origin in its interior.We also show that for non-emp ...
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 ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
Combination approaches can improve the performance of adaptive schemes. In this paper, we study the steady-state performance of an adaptive convex combination of transversal filters and show its universality in the sense that the combination performs, in s ...
