Concept

Marche aléatoire

Publications associées (183)

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

We define "random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or nonconvex domains, random walk on torus, billiards, city section, space graph, intercity and other mod ...

2006

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

Jean-Yves Le Boudec, Milan Vojnovic

We define ``random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or non convex domains, random walk on torus, billiards, city section, space graph, intercity and other m ...

2006

On the Identification of the Synchronous Machine Parameters Using Standstill DC Decay Test.

Jean-Jacques Simond, Mai Tu Xuan, Roland Wetter

This paper presents a refined approach to obtain the parameters of synchronous machine equivalent circuits from standstill DC decay tests. A dedicated program for the time- constants and reactances identification was developed and applied for both d- and q ...

2006

Robust on-line adaptive footplant detection and enforcement for locomotion

Daniel Thalmann, Ronan Boulic, Pascal Glardon

A common problem in virtual character computer animation concerns the preservation of the basic foot-floor constraint (or footplant), consisting in detecting it before enforcing it. This paper describes a system capable of generating motion while continuou ...

Springer-Verlag2006

Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

Mobile wireless ad hoc and sensor networks can be permanently partitioned in many interesting scenarios. This implies that instantaneous end-to-end routes do not exist. Nevertheless, when nodes are mobile, it is possible to forward messages to their destin ...

2006

Proposal strategies for joint state-space tracking with particle filters

Volkan Cevher

A proposal function determines the random particle support of a particle filter. When this support is distributed close to the true target density, filter's estimation performance increases for a given number of particles. In this paper, a proposal strateg ...

2005

Understanding the Simulation of Mobility Models with Palm Calculus

Jean-Yves Le Boudec

The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference between the long term distribution of nodes and the initial one, and sometimes the ...

2005

Surface-stimulated nucleation of reverse domains in ferroelectrics

Nava Setter, Alexander Tagantsev, Guido Gerra

We present a model for reverse domain nucleation in ferroelectrics, which takes into account ferroelectric-electrode coupling in both homogeneous and random cases. The model provides a solution to the coercivity paradox-i.e., the large discrepancy between ...

2005

Power spectra of random spike fields and related processes

Andrea Ridolfi, Pierre Bremaud

This article reviews known results and contains new ones concerning the power spectra of large classes of signals and random fields driven by an underlying point process, such as spatial shot noises (with random impulse response and arbitrary basic station ...

2005

Ultrawide Bandwidth Signals as Shot-Noise: a Unifying Approach

Andrea Ridolfi

This paper presents general methods for obtaining power spectra of a large class of signals and random fields driven by an underlying point processes, in particular spatial shot noises with random impulse response and arbitrary basic stationary point proce ...

2005

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