Concept

Limite (mathématiques élémentaires)

Publications associées (106)

Conceptual Design of a 24 kV, 1 kA Resistive Superconducting Fault Current Limiter

In recent years many large scale demonstrators and prototypes of superconducting fault current limiters have been successfully developed and tested. Within the European Project ECCOFLOW (www.eccoflow.org), it is the first time that a resistive-type superco ...

Ieee-Inst Electrical Electronics Engineers Inc2012

A mean field approach for optimization in discrete time

Nicolas Gabriel Gast

This paper investigates the limit behavior of Markov decision processes made of independent objects evolving in a common environment, when the number of objects (N) goes to infinity. In the finite horizon case, we show that when the number of objects becom ...

2011

Tight lower bounds for the size of epsilon-nets

János Pach, Gábor Tardos

According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an epsilon-net of size O (1/epsilon log 1/epsilon). Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range space ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Order Types of Convex Bodies

We prove a Hadwiger transversal-type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the order type of a family of convex bodies, generalizing the usual definition of ord ...

2011

Reprint of: Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension

Given a set P of n points in R-d and epsilon > 0, we consider the problem of constructing weak E-nets for P. We show the following: pick a random sample Q of size O(1/epsilon log(1/epsilon)) from P. Then, with constant probability, a weak epsilon-net of P ...

2010

The Bounded Confidence Model Of Opinion Dynamics

Jean-Yves Le Boudec, Javier Gomez Serrano

The bounded confidence model of opinion dynamics, introduced by Deffuant et al, is a stochastic model for the evolution of continuous-valued opinions within a finite group of peers. We prove that, as time goes to infinity, the opinions evolve globally into ...

2010

The Stationary Behaviour of Fluid Limits of Reversible Processes is Concentrated on Stationary Points

Jean-Yves Le Boudec

Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called mean field limit", or hydrodynamic limit"). A common practice, often called the ``fixed point approximation" consists in approxi ...

arxiv.org2010

Search for relativistic magnetic monopoles with the AMANDA-II neutrino telescope

Matthias Wolf, Shirit Cohen, Mathieu Ribordy, Xiaoxia Bai

We present the search for Cherenkov signatures from relativistic magnetic monopoles in data taken with the AMANDA-II detector, a neutrino telescope deployed in the Antarctic ice cap at the Geographic South Pole. The non-observation of a monopole signal in ...

2010

Euro 2008 in Geneva: A city’s experience organizing a large-scale event. “Examining “friendly” fan and hooligan behaviour in the Fan Zone

Vincent Kaufmann, Luca Giovanni Pattaroni, Pascal Pierre André Viot

Large-scale events like the 2008 UEFA European Football Championship (commonly referred to as the Euro) put a great deal of strain on the cities that host them, forcing them to find a provisional balance between the pursuit of everyday activities and the a ...

2009

A Mean Field Approach for Optimization in Particle Systems and Applications

Nicolas Gabriel Gast

This paper investigates the limit behavior of Markov decision processes made of independent particles evolving in a common environment, when the number of particles goes to infinity. In the finite horizon case or with a discounted cost and an infinite hori ...

ICST2009

Graph Chatbot

Chattez avec Graph Search

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.

Connectez-vous pour utiliser Chat avec Graph Search