Concept

Fixed-point theorem

Related publications (181)

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.

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

The interval constrained 3-coloring problem

Laura Sanità

In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-co ...

Springer Verlag2010

Asymptotic safety of gravity and the Higgs boson mass

There are indications that gravity is asymptotically safe. The Standard Model (SM) plus gravity could be valid up to arbitrarily high energies. Supposing that this is indeed the case and assuming that there are no intermediate energy scales between the Fer ...

2010

Multi-layer Boosting for Pattern Recognition

François Fleuret

We extend the standard boosting procedure to train a two-layer classifier dedicated to handwritten char- acter recognition. The scheme we propose relies on a hidden layer which extracts feature vectors on a fixed number of points of interest, and an output ...

2009

Achieving Linear Scaling with Interference Alignment

Ayfer Özgür Aydin

Recent results have shown that interference alignment can achieve K/2 degrees of freedom in a K-user interference channel with time or frequency varying channel coefficients. For fixed number of users K, the number of degrees of freedom characterizes the a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Investigation of 3D moisture diffusion coefficients and damage in a pultruded E-glass/polyester structural composite

Thomas Keller, Florian Riebel

As civil engineers seek to improve buildings and bridges, they are turning to composite materials for some structural components. Thus the long-term life of these materials in damp highly acidic conditions (from concrete pore solutions) is critical. This a ...

2009

Numerical analysis of optimization-constrained differential equations

Chantal Landry

The modeling of a system composed by a gas phase and organic aerosol particles, and its numerical resolution are studied. The gas-aerosol system is modeled by ordinary differential equations coupled with a mixed-constrained optimization problem. This coupl ...

EPFL2009

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

Carlo Maffi

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This ...

2009

A Fast Multilevel Algorithm for Wavelet-Regularized Image Restoration

Michaël Unser, Cédric René Jean Vonesch

We present a multilevel extension of the popular "thresholded Landweber" algorithm for wavelet-regularized image restoration that yields an order of magnitude speed improvement over the standard fixed-scale implementation. The method is generic and targete ...

IEEE2009

Particle Swarm Optimization of Memory usage in Embedded Systems

David Atienza Alonso, José Luis Risco Martin

In this paper, we propose a dynamic, non-dominated sorting, multi-objective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly red ...

2009