Fixed-point theorems in infinite-dimensional spaces
Publications associées (102)
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.
We consider the following problem: Given a rational matrix A∈Qm×n and a rational polyhedron Q⊆Rm+p, decide if for all vectors b∈Rm, for which there exists an integral z∈Zp suc ...
We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We consider the case where the number of transitions per time slot per object vanishes as N grows. We show that, ...
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 ...
We consider models of N interacting objects, where the interaction is via a common resource and the distribution of states of all objects. We introduce the key scaling concept of intensity; informally, the expected number of transitions per object per time ...
We extend the standard boosting procedure to train a two-layer classifier dedicated to handwritten character 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 l ...
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
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 ...
We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes under MP decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is given by density e ...
A growing body of evidence suggests that the sensory information from the cytoskeleton and integrins may be responsible for guiding migration during mechano- and haptotaxis. However, the dual function of these subcellular structures as mechano-sensors and ...
We apply the iterated edge state tracking algorithm to study the boundary between laminar and turbulent dynamics in plane Couette flow at Re=400. Perturbations that are not strong enough to become fully turbulent nor weak enough to relaminarize tend toward ...
